Complexity and parameterized algorithms for cograph editing

DOI10.1016/j.tcs.2011.11.040zbMath1253.68179WikidataQ56475005 ScholiaQ56475005MaRDI QIDQ690461

Jiong Guo, Jianxin Wang, Yunlong Liu, Jian'er Chen

Publication date: 27 November 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.11.040

zbMATH Keywords

NP-hardness; parameterized algorithms; \(P_{4}\)-sparse graph; cograph editing

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

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