The Optimized Algorithm of Finding the Shortest Path in a Multiple Graph

DOI10.18255/1818-1015-2023-1-6-15MaRDI QIDQ6081673zbMATH OpenOpenAlexFDO

Authors A. V. Smirnov

Publication date 5 October 2023

Published in Modeling and Analysis of Information Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL http://mathnet.ru/eng/mais787

zbMATH Keywords

multiple graphmultiple pathpolynomial algorithmreachability setshortest path

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Optimally fast shortest path algorithms for some classes of graphs
• Optimal shortest path set problem in undirected graphs
• Finding Multi-Constrained Multiple Shortest Paths
• scientific article; zbMATH DE number 1380434
• Computing the nxm shortest path efficiently
• An efficient implementation of an algorithm for findingK shortest simple paths
• scientific article; zbMATH DE number 4066938
• An improved multiobjective shortest path algorithm
• An improvement of Dijkstra's method for finding a shortest path in a graph

Cites work

• A note on two problems in connexion with graphs
• Algorithms for the Assignment and Transportation Problems
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph

Cited in

(3)

• Finding Multi-Constrained Multiple Shortest Paths
• SHORTEST PATH SIMPLEX ALGORITHM WITH A MULTIPLE PIVOT RULE: A COMPARATIVE STUDY
• The algorithms for the Eulerian cycle and Eulerian trail problems for a multiple graph

This page was built for publication: The Optimized Algorithm of Finding the Shortest Path in a Multiple Graph

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