Worst case analysis of a greedy algorithm for graph thickness (Q1007554)
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 5530897
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Worst case analysis of a greedy algorithm for graph thickness |
scientific article; zbMATH DE number 5530897 |
Statements
Worst case analysis of a greedy algorithm for graph thickness (English)
0 references
23 March 2009
0 references
greedy algorithm
0 references
graph thickness
0 references
maximum planar subgraph
0 references
graph algorithms
0 references
0.8951459
0 references
0.8856119
0 references
0.8696343
0 references
0.86428607
0 references
0.85943043
0 references
0.85656697
0 references
