Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems (Q5301409)
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 the Maximum Induced Planar and Outerplanar Subgraph Problems |
scientific article; zbMATH DE number 5493577
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems |
scientific article; zbMATH DE number 5493577 |
Statements
Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems (English)
0 references
19 January 2009
0 references
largest subset of vertices of a graph
0 references
planar subgraph
0 references
0.8573554754257202
0 references
0.8556281328201294
0 references
0.8529403805732727
0 references
0.8396519422531128
0 references
