Exploring the Subexponential Complexity of Completion Problems

DOI10.1145/2799640zbMath1347.68180WikidataQ60488388 ScholiaQ60488388MaRDI QIDQ2828210

Fedor V. Fomin, Michał Pilipczuk, Yngve Villanger, Pål Grønås Drange

Publication date: 24 October 2016

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

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

zbMATH Keywords

modification; edge completion; subexponential parameterized complexity

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)