Smirnov, A. V. (2021). NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3. Yaroslavl State University.
Chicago Style (17th ed.) CitationSmirnov, Alexander Valeryevich. NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity K ≥ 3. Yaroslavl State University, 2021.
MLA (9th ed.) CitationSmirnov, Alexander Valeryevich. NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity K ≥ 3. Yaroslavl State University, 2021.
Warning: These citations may not always be 100% accurate.