Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems.

Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems.

Bibliografiska uppgifter
I publikationen:Information processing letters. 61, 5 (1997).
Huvudupphovsman: Thilikos, Dimitrios M.
Materialtyp: Artikel
Språk:English
Ämnen:
Algorithms.
Analysis of algorithms.
Approximation algorithms.
Combinatorial problems.
Graph minors.
Treewidth.