NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3

Alexander Valeryevich Smirnov

Modeling and Analysis of Information Systems
Modelirovanie i analiz informacionnyh sistem

ISSN 1818-1015 (Print)
ISSN 2313-5417 (Online)

User

eng | рус

Modeling and Analysis of Information Systems

Advanced search

Archives

Download this PDF file

Fullscreen

For citations:

Smirnov A.V. NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3. Modeling and Analysis of Information Systems. 2021;28(1):22-37. (In Russ.) https://doi.org/10.18255/1818-1015-2021-1-22-37

This work is licensed under a Creative Commons Attribution 4.0 License.

ISSN 1818-1015 (Print)
ISSN 2313-5417 (Online)

Username
Password
	Remember me
Not a user? Register with this site Forgot your password?

User

Modeling and Analysis of Information Systems

For citations:

Cookies policy