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.

書目詳細資料
發表在:Information processing letters. 61, 5 (1997).
主要作者: Thilikos, Dimitrios M.
格式: Article
語言:English
主題:
Algorithms.
Analysis of algorithms.
Approximation algorithms.
Combinatorial problems.
Graph minors.
Treewidth.