Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems (Q287003): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 00:56, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems |
scientific article |
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
