An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs (Q3549662)

From MaRDI portal
Revision as of 00:22, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs
scientific article

    Statements

    title
    An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs (English)
    0 references
    author
    Ramesh Hariharan
    0 references
    Telikepalli Kavitha
    0 references
    Debmalya Panigrahi
    0 references
    Anand Bhalgat
    0 references
    publication date
    5 January 2009
    0 references
    zbMATH DE Number
    5485497
    0 references
    zbMATH Keywords
    Gomory-Hu tree
    0 references
    cut tree
    0 references
    unweighted undirected graphs
    0 references
    minimum Steiner cut
    0 references
    OpenAlex ID
    W1964773853
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3549662&oldid=32369176"
    Powered by MediaWiki