A Golden Ratio Parameterized Algorithm for Cluster Editing
From MaRDI portal
Publication:3111642
DOI10.1007/978-3-642-25011-8_7zbMath1314.05197OpenAlexW2113879091MaRDI QIDQ3111642
Publication date: 13 January 2012
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-25011-8_7
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (4)
On making directed graphs transitive ⋮ Branch-and-cut approaches for \(p\)-cluster editing ⋮ Branch-and-price for \(p\)-cluster editing ⋮ The Multi-parameterized Cluster Editing Problem
This page was built for publication: A Golden Ratio Parameterized Algorithm for Cluster Editing
