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

DOI10.18255/1818-1015-2022-4-372-387MaRDI QIDQ6081672zbMATH 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/mais786

zbMATH Keywords

divisible graphmultiple graphmultiple pathpolynomial algorithmreachability setshortest path

Mathematics Subject Classification ID

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

Cites work

• A note on two problems in connexion with graphs
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• Introduction to algorithms.
• Metagraphs and their applications.
• Spanning tree of a multiple graph

Cited in

(1)

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

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

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