The thickness of graphs: A survey (Q1385299)
From MaRDI portal
!
WARNING
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 1146347
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The thickness of graphs: A survey |
scientific article; zbMATH DE number 1146347 |
Statements
The thickness of graphs: A survey (English)
0 references
26 April 1998
0 references
The study of the thickness parameter for graphs is surveyed, both in terms of theoretical results and practical computation. Three heuristics for planarization are compared, the approach being to iteratively extract possibly large planar subgraphs until a planar subgraph remains.
0 references
survey
0 references
thickness
0 references
planar subgraph
0 references
0.7951225638389587
0 references
0.7935949563980103
0 references
0.7773959040641785
0 references
