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.

Bibliografiset tiedot
Julkaisussa:Information processing letters. 61, 5 (1997).
Päätekijä: Thilikos, Dimitrios M.
Aineistotyyppi: Artikkeli
Kieli:English
Aiheet:
Algorithms.
Analysis of algorithms.
Approximation algorithms.
Combinatorial problems.
Graph minors.
Treewidth.