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

From MaRDI portal
Revision as of 23:30, 19 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
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
    OpenAlex ID
    W1993946385
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3474888&oldid=32398334"
    Powered by MediaWiki