Parallel Algorithms in Graph Theory: Planarity Testing (Q3957959): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q56431282, #quickstatements; #temporary_batch_1709751086066
Property / Wikidata QID
 
Property / Wikidata QID: Q56431282 / rank
 
Normal rank

Revision as of 21:39, 6 March 2024

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