A linear time heuristic for the branch-decomposition of planar graphs (Q5897291)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5677173
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear time heuristic for the branch-decomposition of planar graphs |
scientific article; zbMATH DE number 5677173 |
Statements
Algorithms - ESA 2003 (English)
0 references
3 March 2010
0 references
biconnected planar graphbipartite graph
0 references
set of vertices
0 references
set of faces
0 references
vertex face incidence
0 references
planar drawing
0 references
0.8917935490608215
0 references
0.88478022813797
0 references
0.8676040172576904
0 references
0.8639198541641235
0 references
0.8609859943389893
0 references
