Abstract
Undirected multiple graphs of any natural multiplicity k > 1 are studied. 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. 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 k linked edges of some multi-edge. If a vertex is the common end of some multi-edge, it cannot be the common edge of another multi-edge. A multiple tree is a connected multiple graph with no cycles. Unlike ordinary trees, the number of edges in a multiple tree is not fixed. The problem of finding the spanning tree can be set for a multiple graph. Complete spanning trees form a special class of spanning trees of a multiple graph. Their peculiarity is that a multiple path joining any two selected vertices exists in the tree if and only if such a path exists in the initial graph. If the multiple graph is weighted, the minimum spanning tree problem and the minimum complete spanning tree problem can be set. As well, it is possible to formulate the problems of recognition of the spanning tree and complete spanning tree of the limited weight. The main result of this article is the proof of NP-completeness of such recognition problems for arbitrary multiple graphs as well as for divisible multiple graphs in the case when multiplicity k ≥ 3. The corresponding optimization problems are NP-hard.
REFERENCES
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
Smirnov, A.V., The spanning tree of a divisible multiple graph, Autom. Control Comput. Sci., 2018, vol. 52, no. 7, pp. 871–879. https://doi.org/10.3103/S0146411618070325
Kruskal, J.B., On the shortest spanning subtree of a graph and the traveling salesman problem, Proc. Am. Math. Soc., 1956, vol. 7, no. 1, pp. 48–50. https://doi.org/10.1090/S0002-9939-1956-0078686-7
Cormen, T.H., Leiserson, C.E., Rivest, R.L., and Stein, C., Introduction to Algorithms, The MIT Press, 2009, 3rd ed.
Berge C., Graphs and Hypergraphs, North-Holland, 1973.
Basu, A. and Blanning, R.W., Metagraphs in workflow support systems, Decis. Support Syst., 1999, vol. 25, no. 3, pp. 199–208. https://doi.org/10.1016/S0167-9236(99)00006-8
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
Rublev, V.S. and Smirnov, A.V., Flows in multiple networks, Yaroslavsky Pedagog. Vestn., 2011, vol. 3, no. 2, pp. 60–68.
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
Ford, L.R. and Fulkerson, D.R., Flows in Networks, Princeton Univ. Press, 1962.
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.
Smirnov, A.V., Network model for the problem of integer balancing of a four-dimensional matrix, Autom. Control Comput. Sci., vol. 51, no. 7, pp. 558–566, 2017. https://doi.org/10.3103/S0146411617070185
Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, 1979.
Karp, R., Reducibility among combinatorial problems, Complexity of Computer Computations, Miller, R.E. and Thatcher, J.W., Eds., Plenum, 1972, pp. 85–103. https://doi.org/10.1007/978-1-4684-2001-2_9
Funding
This work was supported by Demidov Yaroslavl State University, project no. VIP-016.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
The author declares that he has no conflicts of interest.
Additional information
Translated by E. Oborin
About this article
Cite this article
Smirnov, A.V. NP-Completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3. Aut. Control Comp. Sci. 56, 788–799 (2022). https://doi.org/10.3103/S0146411622070173
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0146411622070173