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.

Podrobná bibliografie
Vydáno v:Information processing letters. 61, 5 (1997).
Hlavní autor: Thilikos, Dimitrios M.
Médium: Článek
Jazyk:English
Témata:
Algorithms.
Analysis of algorithms.
Approximation algorithms.
Combinatorial problems.
Graph minors.
Treewidth.