On Editing Graphs into 2-Club Clusters
From MaRDI portal
Publication:2897998
DOI10.1007/978-3-642-29700-7_22zbMath1304.68063OpenAlexW2133148645MaRDI QIDQ2897998
Hong Liu, Daming Zhu, Peng Zhang
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
Analysis of algorithms (68W40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (18)
Finding disjoint dense clubs in a social network ⋮ On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering ⋮ Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule? ⋮ An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion ⋮ \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs ⋮ \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs ⋮ On the 2-Club Polytope of Graphs ⋮ Algorithms for 2-club cluster deletion problems using automated generation of branching rules ⋮ 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 ⋮ On 2-clubs in graph-based data clustering: theory and algorithm engineering ⋮ Finding Disjoint Dense Clubs in an Undirected Graph ⋮ Multivariate algorithmics for finding cohesive subnetworks ⋮ Even better fixed-parameter algorithms for bicluster editing ⋮ On the tractability of covering a graph with 2-clubs ⋮ Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics ⋮ Algorithms and complexity of \(s\)-club cluster vertex deletion
This page was built for publication: On Editing Graphs into 2-Club Clusters
