Skip to main content
SpringerLink
Log in

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

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

Abstract

In this paper, we study undirected multiple graphs of any natural multiplicity k > 1. There are edges of three types: ordinary edges, multiple edges, and multiedges. Each edge of the last two types is a union of k linked edges, which connect 2 or (k + 1) vertices, correspondingly. The linked edges should be used simultaneously. If a vertex is incident to a multiple edge, it can also be incident to other multiple edges and it can be the common end of k linked edges of some multiedge. If a vertex is the common end of some multiedge, it cannot be the common end of another multiedge. Divisible multiple graphs are characterized by the possibility to divide the graph into k 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 k ordinary paths, which are adjusted on the linked edges of all multiple and multiedges. In this article, we show that the problem of the shortest path is polynomial for a divisible multiple graph. The corresponding polynomial algorithm is formulated. We also propose the modification of the algorithm for the case of an arbitrary multiple graph. This modification has an exponential complexity in the parameter k.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1.
Fig. 2.
Fig. 3.
Fig. 4.
Fig. 5.
Fig. 6.
Fig. 7.
Fig. 8.

REFERENCES

  1. Smirnov, A.V., The shortest path problem for a multiple graph, Autom. Control Comput. Sci., 2018, vol. 52, no. 7, pp. 625–633. https://doi.org/10.3103/s0146411618070234

    Article  ADS  Google Scholar 

  2. Cormen, T.H., Leiserson, C.E., Rivest, R.L., and Stein, C., Introduction to Algorithms, McGraw-Hill, 2009, 3rd ed.

    Google Scholar 

  3. Graphs and Hypergraphs, Berge, C., Ed., North-Holland Mathematical Library, vol. 6, North-Holland, 1973.

  4. Basu, A. and Blanning, R.W., Metagraphs in workflow support systems, Decision Support Syst., 1999, vol. 25, no. 3, pp. 199–208. https://doi.org/10.1016/s0167-9236(99)00006-8

    Article  Google Scholar 

  5. Basu, A. and Blanning, R.W., Metagraphs and Their Applications, Integrated Series in Information Systems, vol. 15, New York: Springer, 2007. https://doi.org/10.1007/978-0-387-37234-1

  6. Rublev, V.S. and Smirnov, A.V., Flows in multiple networks, Yaroslavsky Pedagogichesky Vestn., 2011, vol. 3, no. 2, pp. 60–68.

    Google Scholar 

  7. Smirnov, A.V., The problem of finding the maximum multiple flow in the divisible network and its special cases, Autom. Control Comput. Sci., 2016, vol. 50, no. 7, pp. 527–535. https://doi.org/10.3103/s0146411616070191

    Article  Google Scholar 

  8. Ford, L.R. and Fulkerson, D.R., Flows in networks, Princeton Univ. Press, 1962.

    Google Scholar 

  9. Roublev, V.S. and Smirnov, A.V., The problem of integer-valued balancing of a three-dimensional matrix and algorithms of its solution, Model. Anal. Inf. Sist., 2010, vol. 17, no. 2, pp. 72–98.

    Google Scholar 

  10. Smirnov, A.V., Network model for the problem of integer balancing of a four-dimensional matrix, Autom. Control Comput. Sci., 2017, vol. 51, no. 7, pp. 558–566. https://doi.org/10.3103/s0146411617070185

    Article  Google Scholar 

  11. Smirnov, A.V., Spanning tree of a multiple graph, J. Comb. Optim., 2022, vol. 43, no. 4, pp. 850–869. https://doi.org/10.1007/s10878-021-00810-5

    Article  MathSciNet  Google Scholar 

  12. Dijkstra, E.W., A note on two problems in connexion with graphs, Numerische Mathematik, 1959, vol. 1, no. 1, pp. 269–271. https://doi.org/10.1007/bf01386390

    Article  MathSciNet  Google Scholar 

Download references

Funding

This study was supported by Demidov Yaroslavl State University, project no. VIP-016.

Author information

Authors and Affiliations

  1. Demidov Yaroslavl State University, 150003, Yaroslavl, Russia

    A. V. Smirnov

Authors
  1. A. V. Smirnov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. V. Smirnov.

Ethics declarations

The authors of this work declare that they have no conflicts of interest.

Additional information

Translated by K. Gumerov

Publisher’s Note.

Allerton Press remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Smirnov, A.V. The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph. Aut. Control Comp. Sci. 57, 841–853 (2023). https://doi.org/10.3103/S0146411623070143

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0146411623070143

Keywords:

Search

Navigation