Two new approximation algorithms for the maximum planar subgraph problem (Q3615285)
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 5530060
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two new approximation algorithms for the maximum planar subgraph problem |
scientific article; zbMATH DE number 5530060 |
Statements
19 March 2009
0 references
maximum planar subgraph
0 references
maximum outerplanar subgraph
0 references
thickness
0 references
outerthickness
0 references
triangular cactus heuristic
0 references
approximation algorithm
0 references
0.8770578503608704
0 references
0.8705947399139404
0 references
0.859941303730011
0 references
