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.

Bibliografski detalji
Izdano u:Information processing letters. 61, 5 (1997).
Glavni autor: Thilikos, Dimitrios M.
Format: Članak
Jezik:English
Teme:
Algorithms.
Analysis of algorithms.
Approximation algorithms.
Combinatorial problems.
Graph minors.
Treewidth.