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.

Bibliographische Detailangaben
Veröffentlicht in:Information processing letters. 61, 5 (1997).
1. Verfasser: Thilikos, Dimitrios M.
Format: Artikel
Sprache:English
Schlagworte:
Algorithms.
Analysis of algorithms.
Approximation algorithms.
Combinatorial problems.
Graph minors.
Treewidth.