Exact algorithm for the problem of the minimum complete spanning tree of a divisible multiple graph
https://doi.org/10.18255/1818-1015-2025-2-132-149
Abstract
We study undirected multiple graphs of any natural multiplicity $k > 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 $k$ linked edges, which connect 2 or $(k + 1)$ vertices, correspondingly. The linked edges should be used simultaneously. Divisible graphs form a special class of multiple graphs. The main peculiarity of them is a 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.
The multiple tree is a multiple graph with no multiple cycles. The number of edges may be different for multiple trees with the same number of vertices. Also we can consider spanning trees of a multiple graph. A spanning tree is complete if a multiple path joining any two selected vertices exists in the tree if and only if such a path exists in the initial graph.
The problem of the minimum complete spanning tree of a multiple graph is NP-hard even in the case of a divisible graph. In this article, we obtain an exact algorithm for the problem of the minimum complete spanning tree of a divisible multiple graph. Also we define a subclass of divisible graphs, for which the algorithm runs in polynomial time.
The multiple tree is a multiple graph with no multiple cycles. The number of edges may be different for multiple trees with the same number of vertices. Also we can consider spanning trees of a multiple graph. A spanning tree is complete if a multiple path joining any two selected vertices exists in the tree if and only if such a path exists in the initial graph.
The problem of the minimum complete spanning tree of a multiple graph is NP-hard even in the case of a divisible graph. In this article, we obtain an exact algorithm for the problem of the minimum complete spanning tree of a divisible multiple graph. Also we define a subclass of divisible graphs, for which the algorithm runs in polynomial time.
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. A. V. Smirnov, “The Spanning Tree of a Divisible Multiple Graph,” Automatic Control and Computer Sciences, vol. 52, no. 7, pp. 871–879, 2018, doi: 10.3103/S0146411618070325.
3. 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.
4. A. V. Smirnov, “NP-Completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity $k geqslant 3$,” Automatic Control and Computer Sciences, vol. 56, no. 7, pp. 788–799, 2022, doi: 10.3103/S0146411622070173.
5. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 3rd ed. The MIT Press, McGraw-Hill Book Company, 2009.
6. C. Berge, Graphs and Hypergraphs. North-Holland Publishing Company, 1973.
7. 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.
8. A. Basu and R. W. Blanning, Metagraphs and Their Applications, vol. 15. Springer US, 2007.
9. V. S. Rublev and A. V. Smirnov, “Flows in Multiple Networks,” Yaroslavsky Pedagogichesky Vestnik, vol. 3, no. 2, pp. 60–68, 2011.
10. 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.
11. L. R. Ford and D. R. Fulkerson, Flows in Networks. Princeton University Press, 1962.
12. 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.
13. 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.
14. J. B. Kruskal, “On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem,” Proceedings of the American Mathematical Society, vol. 7, no. 1, pp. 48–50, 1956, doi: 10.1090/S0002-9939-1956-0078686-7.
Review
For citations:
Smirnov A.V. Exact algorithm for the problem of the minimum complete spanning tree of a divisible multiple graph. Modeling and Analysis of Information Systems. 2025;32(2):132-149. (In Russ.) https://doi.org/10.18255/1818-1015-2025-2-132-149
Views:
28
Email this article 