Split Contraction
From MaRDI portal
Publication:5205814
DOI10.1145/3319909zbMath1496.68260OpenAlexW2948240252MaRDI QIDQ5205814
Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi, Akanksha Agrawal
Publication date: 16 December 2019
Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3319909
Graph theory (including graph drawing) in computer science (68R10) Graph minors (05C83) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (7)
On the parameterized complexity of maximum degree contraction problem ⋮ Parameterized analysis and crossing minimization problems ⋮ On the parameterized complexity of grid contraction ⋮ Reducing the vertex cover number via edge contractions ⋮ A single exponential-time FPT algorithm for cactus contraction ⋮ Contracting to a longest path in H-free graphs ⋮ On the Parameterized Complexity of Maximum Degree Contraction Problem.
This page was built for publication: Split Contraction
