A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing

DOI10.1007/978-3-642-02158-9_20zbMath1246.68171OpenAlexW2163568607MaRDI QIDQ3638452

Rolf Niedermeier, Christian Komusiewicz, Johannes Uhlmann, Jiong Guo

Publication date: 2 July 2009

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02158-9_20

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Graph-Based Data Clustering with Overlaps ⋮ Co-2-plex polynomials ⋮ Graph-based data clustering with overlaps ⋮ Unnamed Item ⋮ Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs

Cites Work

• Unnamed Item
• Correlation clustering
• A more effective linear kernelization for cluster editing
• Cluster graph modification problems
• Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem
• Exact Algorithms for Cluster Editing: Evaluation and Experiments
• Isolation Concepts for Enumerating Dense Subgraphs
• A graph‐theoretic generalization of the clique concept
• Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
• Efficient Parameterized Preprocessing for Cluster Editing
• Going Weighted: Parameterized Algorithms for Cluster Editing
• Depth-First Search and Linear Graph Algorithms