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.

Manylion Llyfryddiaeth
Cyhoeddwyd yn:Information processing letters. 61, 5 (1997).
Prif Awdur: Thilikos, Dimitrios M.
Fformat: Erthygl
Iaith:English
Pynciau:
Algorithms.
Analysis of algorithms.
Approximation algorithms.
Combinatorial problems.
Graph minors.
Treewidth.