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.

Opis bibliograficzny
Wydane w:Information processing letters. 61, 5 (1997).
1. autor: Thilikos, Dimitrios M.
Format: Artykuł
Język:English
Hasła przedmiotowe:
Algorithms.
Analysis of algorithms.
Approximation algorithms.
Combinatorial problems.
Graph minors.
Treewidth.