scientific article; zbMATH DE number 6862097
From MaRDI portal
Publication:4636602
DOI10.4230/LIPIcs.STACS.2017.5zbMath1402.68136MaRDI QIDQ4636602
Akanksha Agrawal, Saket Saurabh, Meirav Zehavi, Daniel Lokshtanov
Publication date: 19 April 2018
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph minors (05C83) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (5)
On the parameterized complexity of contraction to generalization of trees ⋮ Fine-grained complexity of rainbow coloring and its variants ⋮ Fine-Grained Complexity of Rainbow Coloring and its Variants. ⋮ On the Parameterized Complexity of Contraction to Generalization of Trees. ⋮ On the Parameterized Approximability of Contraction to Classes of Chordal Graphs
This page was built for publication:
