Finite Integer Index of Pathwidth and Treewidth
2014; Springer Science+Business Media; Linguagem: Inglês
10.1007/978-3-319-13524-3_22
ISSN1611-3349
AutoresJakub Gajarský, Jan Óbdržálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar,
Tópico(s)Complexity and Algorithms in Graphs
ResumoWe show that the optimization versions of the Pathwidth and Treewidth problems have a property called finite integer index when the inputs are restricted to graphs of bounded pathwidth and bounded treewidth, respectively. They do not have this property in general graph classes. This has interesting consequences for kernelization of both these (optimization) problems on certain sparse graph classes. In the process we uncover an interesting property of path and tree decompositions, which might be of independent interest.
Referência(s)