Parallel Algorithms in Graph Theory: Planarity Testing (Q3957959)

From MaRDI portal
Revision as of 00:21, 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
Parallel Algorithms in Graph Theory: Planarity Testing
scientific article

    Statements

    Parallel Algorithms in Graph Theory: Planarity Testing (English)
    0 references
    0 references
    0 references
    0 references
    1982
    0 references
    0 references
    0 references
    0 references
    0 references
    parallel algorithms
    0 references
    planarity testing
    0 references
    triconnected components of undirected graphs
    0 references
    pseudoembedding
    0 references
    plane mesh
    0 references
    embeddings of triconnected planar graphs in the plane
    0 references
    0 references
    0 references