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

From MaRDI portal
Revision as of 11:17, 7 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(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

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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references