Subexponential Parameterized Algorithm for I <scp>nterval</scp> C <scp>ompletion</scp>

DOI10.1145/3186896zbMath1454.68094OpenAlexW3000706835MaRDI QIDQ4554363

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

Publication date: 13 November 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3186896

zbMATH Keywords

interval graphscompletion problemsgraph modification problemssubexponential algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (5)

A survey of parameterized algorithms and the complexity of edge modification ⋮ Unnamed Item ⋮ Paths to trees and cacti ⋮ Subexponential parameterized algorithms and kernelization on almost chordal graphs ⋮ On the Parameterized Approximability of Contraction to Classes of Chordal Graphs

This page was built for publication: Subexponential Parameterized Algorithm for I <scp>nterval</scp> C <scp>ompletion</scp>