Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs
DOI10.1007/978-3-642-16926-7_17zbMath1309.68153OpenAlexW1737447011MaRDI QIDQ3057623
Christophe Paul, Jesper Nederlof, Jan Arne Telle, Pinar Heggernes, Daniel Lokshtanov
Publication date: 16 November 2010
Published in: Graph Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-16926-7_17
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (8)
Cites Work
- Unnamed Item
- Graph-modeled data clustering: Exact algorithms for clique generation
- Fixed-parameter enumerability of cluster editing and related problems
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Automated generation of search tree algorithms for hard graphs modification problems
- Cluster graph modification problems
- Clustering with qualitative information
- Clustering with Local Restrictions
- The Cluster Editing Problem: Implementations and Experiments
- A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
- Editing Graphs into Disjoint Unions of Dense Clusters
- Graph-Based Data Clustering with Overlaps
- Going Weighted: Parameterized Algorithms for Cluster Editing
This page was built for publication: Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs