Finding the \(k\) smallest spanning trees (Q1196455)

From MaRDI portal
Revision as of 14:50, 16 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Finding the \(k\) smallest spanning trees
scientific article

    Statements

    title
    Finding the \(k\) smallest spanning trees (English)
    0 references
    DOI
    10.1007/BF01994879
    0 references
    author
    David Eppstein
    0 references
    published in
    BIT
    0 references
    publication date
    14 December 1992
    0 references
    zbMATH DE Number
    79061
    0 references
    zbMATH Keywords
    computation of a minimum spanning tree
    0 references
    Wikidata QID
    Q56077949
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1196455&oldid=34093510"
    Powered by MediaWiki