Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jcss.2003.12.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2029854525 / rank | |||
Normal rank | |||
Revision as of 18:53, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation algorithms for classes of graphs excluding single-crossing graphs as minors |
scientific article |
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
