Interval Deletion is Fixed-Parameter Tractable
From MaRDI portal
Publication:5383968
DOI10.1137/1.9781611973402.9zbMath1421.68066OpenAlexW2949446242MaRDI QIDQ5383968
Publication date: 20 June 2019
Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611973402.9
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (4)
Parameterized complexity of finding connected induced subgraphs ⋮ Obtaining split graphs by edge contraction ⋮ Faster algorithms for vertex partitioning problems parameterized by clique-width ⋮ Obtaining matrices with the consecutive ones property by row deletions
This page was built for publication: Interval Deletion is Fixed-Parameter Tractable
