A new O(n^ 2) shortest chain algorithm

DOI10.1016/0096-3003(90)90039-6zbMATH Open0696.68077OpenAlexW2064586851MaRDI QIDQ911302FDOQ911302

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

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

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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the shortest route through a network
• A New Polynomially Bounded Shortest Path Algorithm
• New Polynomial Shortest Path Algorithms and Their Computational Attributes

Cited In (1)

• Title not available (Why is that?)

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)