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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Joseph F. Ja'Ja' / rank
Normal rank
 
Property / author
 
Property / author: Joseph F. Ja'Ja' / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56431282 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/0211024 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2071939274 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:21, 20 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
    0 references