Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization
From MaRDI portal
Publication:3012824
DOI10.1007/978-3-642-22006-7_37zbMath1333.68204arXiv1104.4217WikidataQ59567614 ScholiaQ59567614MaRDI QIDQ3012824
Hans L. Bodlaender, Stefan Kratsch, Bart M. P. Jansen
Publication date: 6 July 2011
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1104.4217
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)