Finding Many Optimal Paths Without Growing Any Optimal Path Trees

DOI10.1007/978-3-540-73545-8_24MaRDI QIDQ3608848zbMATH OpenOpenAlexFDO

Authors Danny Z. Chen, Ewa Misiołek

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

Mathematics Subject Classification ID

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

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

Cited in

(5)

• All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
• scientific article; zbMATH DE number 1305095 (Why is no real title available?)
• scientific article; zbMATH DE number 1145908 (Why is no real title available?)
• Finding an optimal path without growing the tree
• Finding many optimal paths without growing any optimal path trees

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)