Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778)
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: Approximation algorithms for classes of graphs excluding single-crossing graphs as minors |
scientific article; zbMATH DE number 2104534
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for classes of graphs excluding single-crossing graphs as minors |
scientific article; zbMATH DE number 2104534 |
Statements
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (English)
0 references
1 October 2004
0 references
graphs of small treewidth
0 references
planar graphs
0 references
0 references
0 references
0.90558475
0 references
0.8943232
0 references
0.8910283
0 references
0.8832438
0 references
0.8829957
0 references
0.8829957
0 references
