Publication:3057623

DOI10.1007/978-3-642-16926-7_17zbMATH Open1309.68153OpenAlexW1737447011MaRDI QIDQ3057623FDOQ3057623

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

Mathematics Subject Classification ID

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)

Cites Work

• Title not available (Why is that?)
• Fixed-parameter tractability of graph modification problems for hereditary properties
• Automated generation of search tree algorithms for hard graphs modification problems
• Clustering with qualitative information
• Cluster graph modification problems
• A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
• The Cluster Editing Problem: Implementations and Experiments
• Graph-modeled data clustering: Exact algorithms for clique generation
• Editing Graphs into Disjoint Unions of Dense Clusters
• Fixed-parameter enumerability of cluster editing and related problems
• Going Weighted: Parameterized Algorithms for Cluster Editing
• Graph-Based Data Clustering with Overlaps
• Clustering with Local Restrictions

Cited In (10)

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the complexity of multi-parameterized cluster editing
• Graph-based data clustering with overlaps
• Clustering with Local Restrictions
• An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion
• Title not available (Why is that?)
• Cluster deletion on interval graphs and split related graphs
• \( \gamma \)-clustering problems: classical and parametrized complexity
• Maximizing the strong triadic closure in split graphs and proper interval graphs

This page was built for publication: Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs

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