An efficient algorithm to find next-to-shortest path on trapezoid graphs

MaRDI QIDQ3639634zbMATH OpenFDO

Authors

Publication date 23 October 2009

Full work available at URL http://www.ripublication.com/Volume/aamav2n2.htm

zbMATH Keywords

analysis of algorithmsshortest pathsdesign of algorithmstrapezoid graphsnext-to-shortest path

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem
• A quadratic algorithm for finding next-to-shortest paths in graphs
• Improved algorithm for finding next-to-shortest paths
• An efficient implementation of an algorithm for findingK shortest simple paths
• A simpler and more efficient algorithm for the next-to-shortest path problem

Cited in

(5)

• Efficient algorithm for the vertex connectivity of trapezoid graphs
• Unrestricted and complete breadth-first search of trapezoid graphs in O(n) time
• An efficient algorithm to solve connectivity problem on trapezoid graphs
• A quadratic algorithm for finding next-to-shortest paths in graphs
• A simpler and more efficient algorithm for the next-to-shortest path problem

This page was built for publication: An efficient algorithm to find next-to-shortest path on trapezoid graphs

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