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.

Détails bibliographiques
Publié dans:Information processing letters. 61, 5 (1997).
Auteur principal: Thilikos, Dimitrios M.
Format: Article
Langue:English
Sujets:
Algorithms.
Analysis of algorithms.
Approximation algorithms.
Combinatorial problems.
Graph minors.
Treewidth.