Cluster Editing
From MaRDI portal
Publication:5326357
DOI10.1007/978-3-642-39053-1_5zbMath1387.68177OpenAlexW4234354705WikidataQ62779992 ScholiaQ62779992MaRDI QIDQ5326357
Jan Baumbach, Sebastian Böcker
Publication date: 5 August 2013
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-39053-1_5
Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (19)
Combining clickstream analyses and graph-modeled data clustering for identifying common response processes ⋮ Destroying Bicolored $P_3$s by Deleting Few Edges ⋮ Linear-time minimal cograph editing ⋮ A new temporal interpretation of cluster editing ⋮ On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering ⋮ An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion ⋮ A survey of parameterized algorithms and the complexity of edge modification ⋮ On 2-clubs in graph-based data clustering: theory and algorithm engineering ⋮ Parameterized dynamic cluster editing ⋮ Tight bounds for parameterized complexity of cluster editing with a small number of clusters ⋮ A faster algorithm for the cluster editing problem on proper interval graphs ⋮ Branch-and-cut approaches for \(p\)-cluster editing ⋮ Branch-and-price for \(p\)-cluster editing ⋮ Polyhedral properties of the induced cluster subgraphs ⋮ The biclique partitioning polytope ⋮ Cluster Editing in Multi-Layer and Temporal Graphs. ⋮ Parameterized Dynamic Cluster Editing ⋮ A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis ⋮ A fast branching algorithm for cluster vertex deletion
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A \(2k\) kernel for the cluster editing problem
- On making directed graphs transitive
- Exact algorithms for cluster editing: Evaluation and experiments
- Correlation clustering
- Cluster editing with locally bounded modifications
- Ein Subgradientenverfahren zur Klassifikation qualitativer Daten
- Graph-modeled data clustering: Exact algorithms for clique generation
- Fixed-parameter enumerability of cluster editing and related problems
- A more effective linear kernelization for cluster editing
- Going weighted: parameterized algorithms for cluster editing
- NP-hard problems in hierarchical-tree clustering
- A cutting plane algorithm for a clustering problem
- Which problems have strongly exponential complexity?
- Cluster editing problem for points on the real line: a polynomial time algorithm
- Cluster editing: kernelization based on edge cuts
- On best transitive approximations to simple graphs
- Automated generation of search tree algorithms for hard graphs modification problems
- Cluster graph modification problems
- A golden ratio parameterized algorithm for cluster editing
- Even faster parameterized cluster deletion and cluster editing
- Applying modular decomposition to parameterized cluster editing problems
- Clustering with qualitative information
- Clustering of microarray data via clique partitioning
- Extension and Robustness of Transitivity Clustering for Protein–Protein Interaction Network Analysis
- Tight bounds for parameterized complexity of Cluster Editing
- Alternative Parameterizations for Cluster Editing
- Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems
- The Lost Continent of Polynomial Time: Preprocessing and Kernelization
- Exact Algorithms for Cluster Editing: Evaluation and Experiments
- Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms
- Approximating Symmetric Relations by Equivalence Relations
- Multicut is FPT
- Fixed-parameter tractability of multicut parameterized by the size of the cutset
- Efficient Parameterized Preprocessing for Cluster Editing
- A Note on Approximating Symmetric Relations by Equivalence Relations
- Aggregating inconsistent information
This page was built for publication: Cluster Editing
