The thickness of graphs: A survey (Q1385299): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q56689311, #quickstatements; #temporary_batch_1707303357582 |
Set profile property. |
||
| (2 intermediate revisions by one other user not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Arthur T. White / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Arthur T. White / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 04:09, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The thickness of graphs: A survey |
scientific article |
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
