Finding minimum congestion spanning trees (Q5463408)

From MaRDI portal
Revision as of 12:03, 9 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article; zbMATH DE number 2192042
Language Label Description Also known as
English
Finding minimum congestion spanning trees
scientific article; zbMATH DE number 2192042

    Statements

    title
    Finding minimum congestion spanning trees (English)
    0 references
    DOI
    10.1145/351827.384253
    0 references
    author
    Renato F. Werneck
    0 references
    João C. Setubal
    0 references
    publication date
    4 August 2005
    0 references
    zbMATH DE Number
    2192042
    0 references
    zbMATH Keywords
    polynomial time algorithm
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5463408&oldid=20244469"
    Powered by MediaWiki