Finding Many Optimal Paths Without Growing Any Optimal Path Trees

DOI10.1007/978-3-540-73545-8_24zbMATH Open1206.05095OpenAlexW2137694630MaRDI QIDQ3608848FDOQ3608848

Ewa Misiołek, Danny Z. Chen

Publication date: 6 March 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73545-8_24

Recommendations

• Finding many optimal paths without growing any optimal path trees
• Finding an optimal path without growing the tree
• scientific article; zbMATH DE number 1305095
• scientific article; zbMATH DE number 1145908
• Finding \(k\) simple shortest paths and cycles

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Cited In (1)

• Finding an optimal path without growing the tree

This page was built for publication: Finding Many Optimal Paths Without Growing Any Optimal Path Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608848)