Minimum congestion spanning trees in bipartite and random graphs (Q655852)

From MaRDI portal
Revision as of 01:52, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Minimum congestion spanning trees in bipartite and random graphs
scientific article

    Statements

    title
    Minimum congestion spanning trees in bipartite and random graphs (English)
    0 references
    publication date
    27 January 2012
    0 references
    zbMATH DE Number
    6002317
    0 references
    zbMATH Keywords
    bipartite graph
    0 references
    random graph
    0 references
    minimum congestion spanning tree
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q655852&oldid=25704736"
    Powered by MediaWiki