Shortest path algorithms using dynamic breadth‐first search
From MaRDI portal
Publication:5749160
DOI10.1002/net.3230210105zbMath0717.90077OpenAlexW2102755248MaRDI QIDQ5749160
Sheng-Roan Kai, Donald Goldfarb, Jianxiu Hao
Publication date: 1991
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230210105
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Time depending shortest-path problems with applications to railway networks, An algorithm for min-cost edge-disjoint cycles and its applications, Engineering Negative Cycle Canceling for Wind Farm Cabling, Atomistic damage mechanisms during hypervelocity projectile impact on AlN: A large-scale parallel molecular dynamics simulation study
Cites Work
