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
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