The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph
https://doi.org/10.18255/1818-1015-2022-4-372-387
Abstract
In this paper, we study undirected multiple graphs of any natural multiplicity к > 1. There are edges of three types: ordinary edges, multiple edges and multi-edges. Each edge of the last two types is a union of к linked edges, which connect 2 or (к + 1) vertices, correspondingly. The linked edges should be used simultaneously. If a vertex is incident to a multiple edge, it can be also incident to other multiple edges and it can be the common end of к linked edges of some multi-edge. If a vertex is the common end of some multi-edge, it cannot be the common end of another multi-edge. Divisible multiple graphs are characterized by a possibility to divide the graph into к parts, which are adjusted on the linked edges and which have no common edges. Each part is an ordinary graph. As for an ordinary graph, we can define the integer function of the length of an edge for a multiple graph and set the problem of the shortest path joining two vertices. Any multiple path is a union of к ordinary paths, which are adjusted on the linked edges of all multiple and multi-edges. In the article, we show that the problem of the shortest path is polynomial for a divisible multiple graph. The corresponding polynomial algorithm is formulated. Also we suggest the modification of the algorithm for the case of an arbitrary multiple graph. This modification has an exponential complexity in the parameter к.
Keywords
multiple graph,
divisible graph,
multiple path,
shortest path,
reachability set,
polynomial algorithm
MSC2020: 05C38, 05C65
About the Author
Alexander Valeryevich Smirnov
P. G. Demidov Yaroslavl State University
Russian Federation
Russian Federation
References
1. A. V. Smirnov, "The Shortest Path Problem for a Multiple Graph”, Automatic Control and Computer Sciences, vol. 52, no. 7, pp. 625-633, 2018. doi: 10.3103/S0146411618070234.
2. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 3rd. The MIT Press, McGraw-Hill Book Company, 2009.
3. C. Berge, Graphs and Hypergraphs. North-Holland Publishing Company, 1973.
4. A. Basu and R. W. Blanning, "Metagraphs in workflow support systems”, Decision Support Systems, vol. 25, no. 3, pp. 199-208, 1999. doi: 10.1016/S0167-9236(99)00006-8.
5. A. Basu and R. W. Blanning, Metagraphs and Their Applications, ser.Integrated Series in Information Systems. Springer US, 2007, vol. 15.
6. V. S.Rublev and A. V. Smirnov, "Flows in Multiple Networks”, Yaroslavsky Pedagogichesky Vestnik, vol. 3, no. 2, pp. 60-68, 2011.
7. A. V. Smirnov, "The Problem of Finding the Maximum Multiple Flow in the Divisible Network and its Special Cases”, Automatic Control and Computer Sciences, vol. 50, no. 7, pp. 527-535, 2016. doi: 10.3103/S0146411616070191.
8. L. R. Ford and D. R. Fulkerson, Flows in Networks. Princeton University Press, 1962.
9. V. S. Roublev and A. V. Smirnov, "The Problem of Integer-Valued Balancing of a Three-Dimensional Matrix and Algorithms of Its Solution”, Modeling and Analysis of Information Systems, vol. 17, no. 2, pp. 72-98, 2010.
10. A. V. Smirnov, "Network Model for the Problem of Integer Balancing of a Four-Dimensional Matrix”, Automatic Control and Computer Sciences, vol. 51, no. 7, pp. 558-566, 2017. doi: 10.3103/ S0146411617070185.
11. A. V. Smirnov, "Spanning tree of a multiple graph”, Journal of Combinatorial Optimization, vol. 43, no. 4, pp. 850-869, 2022. doi: 10.1007/s10878-021-00810-5.
12. E. W. Dijkstra, "A Note on Two Problems in Connexion with Graphs”, Numerische Mathematik, vol. 1, no. 1, pp. 269-271, 1959. doi: 10.1007/BF01386390.
Review
For citations:
Smirnov A.V. The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph. Modeling and Analysis of Information Systems. 2022;29(4):372-387. (In Russ.) https://doi.org/10.18255/1818-1015-2022-4-372-387
Views:
369
Email this article 