Exact Algorithms for Cluster Editing: Evaluation and Experiments

DOI10.1007/978-3-540-68552-4_22MaRDI QIDQ3506417zbMATH OpenOpenAlexFDO

Authors Sebastian Böcker, Sebastian Briesemeister, Gunnar W. Klau

Publication date 13 June 2008

Published in Experimental Algorithms (Search for Journal in Brave)

Full work available at URL https://ir.cwi.nl/pub/14843

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Exact algorithms for cluster editing: Evaluation and experiments
• Efficient algorithms for cluster editing
• Graph-modeled data clustering: Exact algorithms for clique generation
• Cluster editing
• Going Weighted: Parameterized Algorithms for Cluster Editing

Cites work

• A cutting plane algorithm for a clustering problem
• A More Effective Linear Kernelization for Cluster Editing
• Automated generation of search tree algorithms for hard graphs modification problems
• Cluster graph modification problems
• Clustering of microarray data via clique partitioning
• Clustering with qualitative information
• Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
• Going Weighted: Parameterized Algorithms for Cluster Editing
• Graph-modeled data clustering: Exact algorithms for clique generation
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• NP-hard problems in hierarchical-tree clustering
• The Cluster Editing Problem: Implementations and Experiments

Cited in

(24)

• A more effective linear kernelization for cluster editing
• Going weighted: parameterized algorithms for cluster editing
• Branch-and-price for \(p\)-cluster editing
• Even better fixed-parameter algorithms for bicluster editing
• The Multi-parameterized Cluster Editing Problem
• Tight bounds for parameterized complexity of Cluster Editing
• Kernelization and complexity results for connectivity augmentation problems
• Cluster editing: kernelization based on edge cuts
• Alternative parameterizations for cluster editing
• On Making Directed Graphs Transitive
• The Cluster Editing Problem: Implementations and Experiments
• A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
• Kernelization: new upper and lower bound techniques
• A faster algorithm for the cluster editing problem on proper interval graphs
• Branch-and-cut approaches for p-cluster editing
• Graph-Based Data Clustering with Overlaps
• Cluster editing
• Exact algorithms for cluster editing: Evaluation and experiments
• Going Weighted: Parameterized Algorithms for Cluster Editing
• Graph-Theoretic Concepts in Computer Science
• Efficient algorithms for cluster editing
• Polynomial kernels for 3-leaf power graph modification problems
• Data reductions, fixed parameter tractability, and random weighted d-CNF satisfiability
• Efficient algorithms for the block edit problems

This page was built for publication: Exact Algorithms for Cluster Editing: Evaluation and Experiments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3506417)