Login / Signup

The universally quickest transshipment problem in a certain class of dynamic networks with uniform path-lengths.

Naoyuki KamiyamaNaoki Katoh
Published in: Discret. Appl. Math. (2014)
Keyphrases
  • dynamic networks
  • path length
  • dynamic behavior
  • shortest path
  • network analysis
  • network structure
  • data sets
  • databases
  • machine learning
  • high precision
  • small world
  • network dynamics