Parallel Algorithms in Graph Theory: Planarity Testing (Q3957959): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56431282, #quickstatements; #temporary_batch_1709751086066 |
Set OpenAlex properties. |
||
| 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 | |||
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
1982
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
