The computational complexity of the k-minimum spanning tree problem in graded matrices

T. Dudás, B. Klinz, G.J. Woeginger

    Research output: Contribution to journalArticleAcademicpeer-review

    3 Citations (Scopus)

    Fingerprint

    Dive into the research topics of 'The computational complexity of the k-minimum spanning tree problem in graded matrices'. Together they form a unique fingerprint.

    Mathematics

    Engineering & Materials Science