A Separator Theorem for Planar Graphs (Q3869371)

From MaRDI portal
Revision as of 23:33, 1 February 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q56453456, #quickstatements; #temporary_batch_1706826130171)
scientific article
Language Label Description Also known as
English
A Separator Theorem for Planar Graphs
scientific article

    Statements

    A Separator Theorem for Planar Graphs (English)
    0 references
    0 references
    0 references
    1979
    0 references
    planar graph
    0 references
    partition
    0 references
    divide-and-conquer
    0 references
    sparse systems of linear equations
    0 references
    pebbling
    0 references
    post office problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references