Login / Signup
A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths.
Naoyuki Kamiyama
Naoki Katoh
Published in:
ISAAC (2009)
Keyphrases
</>
path length
learning algorithm
np hard
dynamic networks
data mining
social networks
data sets
visual information