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.

Dettagli Bibliografici
Pubblicato in:Information processing letters. 61, 5 (1997).
Autore principale: Thilikos, Dimitrios M.
Natura: Articolo
Lingua:English
Soggetti:
Algorithms.
Analysis of algorithms.
Approximation algorithms.
Combinatorial problems.
Graph minors.
Treewidth.