Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems
From MaRDI portal
Publication:287003
DOI10.1016/S0020-0190(97)00024-0zbMath1336.05138MaRDI QIDQ287003
Hans L. Bodlaender, Dimitrios M. Thilikos
Publication date: 26 May 2016
Published in: Information Processing Letters (Search for Journal in Brave)
algorithms; treewidth; combinatorial problems; analysis of algorithms; approximation algorithms; graph minors
68Q25: Analysis of algorithms and problem complexity
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
