Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems (Q287003): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0020-0190(97)00024-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2088959951 / rank | |||
Normal rank | |||
Latest revision as of 10:13, 30 July 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
