Speeding up the Floyd-Warshall algorithm for the cycled shortest path problem

DOI10.1016/J.AML.2011.06.008zbMath1231.90362OpenAlexW2058044254MaRDI QIDQ656681

Asghar Aini, Amir Salehipour

Publication date: 13 January 2012

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2011.06.008

zbMATH Keywords

Floyd-Warshall algorithmrectangular algorithmshortest path problem with a cycle

Mathematics Subject Classification ID

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

Related Items (1)

Theory and application of reciprocal transformation of “path problem” and “time float problem”

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• Shortest paths algorithms: Theory and experimental evaluation
• On a routing problem
• A Theorem on Boolean Matrices

This page was built for publication: Speeding up the Floyd-Warshall algorithm for the cycled shortest path problem