Cluster editing: kernelization based on edge cuts
From MaRDI portal
Publication:1759680
DOI10.1007/s00453-011-9595-1zbMath1253.68144MaRDI QIDQ1759680
Publication date: 21 November 2012
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-011-9595-1
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
05C22: Signed and weighted graphs