A new O(n^ 2) shortest chain algorithm

DOI10.1016/0096-3003(90)90039-6MaRDI QIDQ911302zbMATH OpenOpenAlexFDO

Authors Gary R. Waissi

Publication date 1990

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0096-3003(90)90039-6

zbMATH Keywords

networkshortest chain algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Theory of software (68N99)

Recommendations

• Shortest path algorithms using dynamic breadth‐first search
• An \(O(nm)\)-time network simplex algorithm for the shortest path problem
• An Auction Algorithm for Shortest Paths
• A novel linear algorithm for shortest paths in networks
• A two-phase shortest path algorithm for networks with node coordinates

Cites work

• scientific article; zbMATH DE number 3688740 (Why is no real title available?)
• scientific article; zbMATH DE number 192986 (Why is no real title available?)
• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• A New Polynomially Bounded Shortest Path Algorithm
• A note on two problems in connexion with graphs
• New Polynomial Shortest Path Algorithms and Their Computational Attributes
• On the shortest route through a network

Cited in

(1)

• scientific article; zbMATH DE number 7235119 (Why is no real title available?)

This page was built for publication: A new \(O(n^ 2)\) shortest chain algorithm

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