Subexponential parameterized algorithm for Interval Completion

DOI10.1137/1.9781611974331.ch78zbMath1410.68282arXiv1402.3473OpenAlexW2949581077MaRDI QIDQ4575658

Michał Pilipczuk, Fedor V. Fomin, Marcin Pilipczuk, Ivan A. Bliznets

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.3473

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Linear-time minimal cograph editing ⋮ Polynomial kernelization for removing induced claws and diamonds ⋮ Approximation and Kernelization for Chordal Vertex Deletion ⋮ Rank reduction of oriented graphs by vertex and edge deletions ⋮ A polynomial kernel for trivially perfect editing

This page was built for publication: Subexponential parameterized algorithm for Interval Completion