Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems (Q287003)
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: Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems |
scientific article; zbMATH DE number 6585382
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems |
scientific article; zbMATH DE number 6585382 |
Statements
Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems (English)
0 references
26 May 2016
0 references
algorithms
0 references
analysis of algorithms
0 references
approximation algorithms
0 references
combinatorial problems
0 references
graph minors
0 references
treewidth
0 references
0.7663113474845886
0 references
0.7441741228103638
0 references
0.7436457872390747
0 references
