Cograph Editing: Complexity and Parameterized Algorithms
From MaRDI portal
Publication:3087943
DOI10.1007/978-3-642-22685-4_10zbMath1348.68070OpenAlexW185036806MaRDI QIDQ3087943
Jiong Guo, Yunlong Liu, Jianxin Wang, Jian'er Chen
Publication date: 17 August 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22685-4_10
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (7)
Orthology Relation and Gene Tree Correction: Complexity Results ⋮ On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions ⋮ Orthology relations, symbolic ultrametrics, and cographs ⋮ Spiders can be recognized by counting their legs ⋮ On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems ⋮ Cograph editing: Merging modules is equivalent to editing P_4s ⋮ On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions
This page was built for publication: Cograph Editing: Complexity and Parameterized Algorithms
