Fast Partitioning l-Apex Graphs with Application to Approximating Maximum Induced-Subgraph Problems

Dimitrios M. Thilikos, Hans Leo Bodlaender. Fast Partitioning l-Apex Graphs with Application to Approximating Maximum Induced-Subgraph Problems. Inf. Process. Lett., 61(5):227-232, 1997. [doi]

Abstract

Abstract is missing.