A new \(O(n^ 2)\) shortest chain algorithm

DOI10.1016/0096-3003(90)90039-6zbMath0696.68077OpenAlexW2064586851MaRDI QIDQ911302

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)

Cites Work

• A note on two problems in connexion with graphs
• On the Shortest Route Through a Network
• A New Polynomially Bounded Shortest Path Algorithm
• New Polynomial Shortest Path Algorithms and Their Computational Attributes
• Unnamed Item
• Unnamed Item
• Unnamed Item

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