Graph-Based Data Clustering with Overlaps

DOI10.1007/978-3-642-02882-3_51zbMath1248.68377OpenAlexW1603912888WikidataQ57359803 ScholiaQ57359803MaRDI QIDQ5323099

Michael R. Fellows, Jiong Guo, Rolf Niedermeier, Christian Komusiewicz, Johannes Uhlmann

Publication date: 23 July 2009

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-02882-3_51

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs ⋮ Alternative Parameterizations for Cluster Editing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Correlation clustering
• 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
• NP-hard problems in hierarchical-tree clustering
• Fixed-parameter tractability of graph modification problems for hereditary properties
• The maximum edge biclique problem is NP-complete
• Cluster graph modification problems
• Applying modular decomposition to parameterized cluster editing problems
• The Cluster Editing Problem: Implementations and Experiments
• Exact Algorithms for Cluster Editing: Evaluation and Experiments
• A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
• Algorithm Theory - SWAT 2004
• Efficient Parameterized Preprocessing for Cluster Editing
• Going Weighted: Parameterized Algorithms for Cluster Editing

This page was built for publication: Graph-Based Data Clustering with Overlaps