The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph

DOI10.18255/1818-1015-2022-4-372-387zbMath1521.05086OpenAlexW4311837466MaRDI QIDQ6081672

Aleksandr Valer'Evich Smirnov

Publication date: 5 October 2023

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

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

zbMATH Keywords

shortest pathpolynomial algorithmreachability setdivisible graphmultiple graphmultiple path

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

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

Cites Work

• A note on two problems in connexion with graphs
• Metagraphs and their applications.
• Spanning tree of a multiple graph
• Unnamed Item
• Unnamed Item
• Unnamed Item

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