Contracting a planar graph efficiently (Q5111739)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Contracting a planar graph efficiently |
scientific article; zbMATH DE number 7205028
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Contracting a planar graph efficiently |
scientific article; zbMATH DE number 7205028 |
Statements
27 May 2020
0 references
planar graphs
0 references
algorithms
0 references
data structures
0 references
connectivity
0 references
coloring
0 references
0 references
0 references
Contracting a Planar Graph Efficiently (English)
0 references
0.8141164183616638
0 references
0.8119317293167114
0 references
0.8035109639167786
0 references
0.803462564945221
0 references
