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.

Xehetasun bibliografikoak
Argitaratua izan da:Information processing letters. 61, 5 (1997).
Egile nagusia: Thilikos, Dimitrios M.
Formatua: Artikulua
Hizkuntza:English
Gaiak:
Algorithms.
Analysis of algorithms.
Approximation algorithms.
Combinatorial problems.
Graph minors.
Treewidth.