On Editing Graphs into 2-Club Clusters

DOI10.1007/978-3-642-29700-7_22MaRDI QIDQ2897998zbMATH OpenOpenAlexFDO

Authors Peng Zhang, Daming Zhu, Hong Liu

Publication date 16 July 2012

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

Full work available at URL https://doi.org/10.1007/978-3-642-29700-7_22

zbMATH Keywords

2-club cluster graphfixed parameter tractabilitygraph-based data clustering

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms (68W40)

Recommendations

• Editing graphs into disjoint unions of dense clusters
• Editing graphs into disjoint unions of dense clusters
• Editing graphs into few cliques: complexity, approximation, and kernelization schemes
• On 2-clubs in graph-based data clustering: theory and algorithm engineering
• On 2-clubs in graph-based data clustering: theory and algorithm engineering
• On the clique editing problem
• The Cluster Editing Problem: Implementations and Experiments
• A \(2k\) kernel for the cluster editing problem
• A 2k kernel for the cluster editing problem
• Cluster Editing in Multi-Layer and Temporal Graphs.

Cited in

(28)

• Multivariate algorithmics for finding cohesive subnetworks
• Cluster graph modification problems
• Even better fixed-parameter algorithms for bicluster editing
• Algorithms and complexity of \(s\)-club cluster vertex deletion
• Subexponential algorithm for d-cluster edge deletion: exception or rule?
• Finding disjoint dense clubs in a social network
• On 2-clubs in graph-based data clustering: theory and algorithm engineering
• Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics
• On the 2-club polytope of graphs
• A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
• scientific article; zbMATH DE number 1953109 (Why is no real title available?)
• Finding Disjoint Dense Clubs in an Undirected Graph
• On 2-clubs in graph-based data clustering: theory and algorithm engineering
• Parameterized algorithmics and computational experiments for finding 2-clubs
• On the tractability of covering a graph with 2-clubs
• An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion
• s-club cluster vertex deletion on interval and well-partitioned chordal graphs
• Algorithms for 2-club cluster deletion problems using automated generation of branching rules
• \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs
• A survey of parameterized algorithms and the complexity of edge modification
• On the parameterized complexity of s-club cluster deletion problems
• On the parameterized complexity of \(s\)-club cluster deletion problems
• Improved kernelization and fixed-parameter algorithms for bicluster editing
• On the complexity of 2-club cluster editing with vertex splitting
• Domination in diameter-two graphs and the 2-club cluster vertex deletion parameter
• Dense graph partitioning on sparse and dense graphs
• Breaking a graph into connected components with small dominating sets
• Elimination distance to dominated clusters

This page was built for publication: On Editing Graphs into 2-Club Clusters

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