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.

Sonraí bibleagrafaíochta
Foilsithe in:Information processing letters. 61, 5 (1997).
Príomhchruthaitheoir: Thilikos, Dimitrios M.
Formáid: Alt
Teanga:English
Ábhair:
Algorithms.
Analysis of algorithms.
Approximation algorithms.
Combinatorial problems.
Graph minors.
Treewidth.