Graph-Based Data Clustering with Overlaps

DOI10.1007/978-3-642-02882-3_51MaRDI QIDQ5323099zbMATH OpenOpenAlexWikidataFDO

Authors Michael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, 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

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

Recommendations

• Graph-based data clustering with overlaps
• Cluster graph modification problems
• scientific article; zbMATH DE number 1953109
• Graph-modeled data clustering: Exact algorithms for clique generation
• Fixed-Parameter Tractable Generalizations of Cluster Editing

Cites work

• A more effective linear kernelization for cluster editing
• A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
• Algorithm Theory - SWAT 2004
• Applying modular decomposition to parameterized cluster editing problems
• Cluster graph modification problems
• Correlation clustering
• Efficient Parameterized Preprocessing for Cluster Editing
• Exact Algorithms for Cluster Editing: Evaluation and Experiments
• Fixed-parameter enumerability of cluster editing and related problems
• Fixed-parameter tractability of graph modification problems for hereditary properties
• Going Weighted: Parameterized Algorithms for Cluster Editing
• Graph-modeled data clustering: Exact algorithms for clique generation
• scientific article; zbMATH DE number 3487498 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• NP-hard problems in hierarchical-tree clustering
• Recognition algorithm for diamond-free graphs
• The Cluster Editing Problem: Implementations and Experiments
• The maximum edge biclique problem is NP-complete

Cited in

(10)

• A stratificational overlapping cluster scheme
• Centroid based tree-structured data clustering using vertex/edge overlap and graph edit distance
• Generalized graph clustering: recognizing (p,q)-cluster graphs
• Alternative parameterizations for cluster editing
• Graph-based data clustering with overlaps
• Finding Non-Overlapping Clusters for Generalized Inference Over Graphical Models
• On the advantage of overlapping clusters for minimizing conductance
• Watersheds on Hypergraphs for Data Clustering
• Overlapping Clustering in a Graph Using k-Means and Application to Protein Interactions Networks
• Cluster editing with overlapping communities

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

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