A Heuristic Algorithm for Small Separators in Arbitrary Graphs (Q3474888)

From MaRDI portal
Revision as of 21:26, 4 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
A Heuristic Algorithm for Small Separators in Arbitrary Graphs
scientific article

    Statements

    title
    A Heuristic Algorithm for Small Separators in Arbitrary Graphs (English)
    0 references
    publication date
    1990
    0 references
    zbMATH Keywords
    random algorithms
    0 references
    separators in graphs
    0 references
    flows in networks
    0 references

    Identifiers

    DOI
    10.1137/0219018
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    68W99
    0 references
    05C99
    0 references
    zbMATH DE Number
    4143441
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3474888&oldid=16808725"
    Powered by MediaWiki