On 2-clubs in graph-based data clustering: theory and algorithm engineering
From MaRDI portal
Publication:2692726
DOI10.1007/978-3-030-75242-2_15OpenAlexW3165512526MaRDI QIDQ2692726
Aleksander Figiel, André Nichterlein, Anne-Sophie Himmel, Rolf Niedermeier
Publication date: 22 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-75242-2_15
Related Items (4)
On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering ⋮ An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion ⋮ Algorithms for 2-club cluster deletion problems using automated generation of branching rules ⋮ On the tractability of covering a graph with 2-clubs
Uses Software
Cites Work
- A fast branching algorithm for cluster vertex deletion
- Graph-based data clustering with overlaps
- Exact algorithms for cluster editing: Evaluation and experiments
- Cluster editing with locally bounded modifications
- Graph-modeled data clustering: Exact algorithms for clique generation
- Fixed-parameter algorithms for cluster vertex deletion
- Going weighted: parameterized algorithms for cluster editing
- Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments
- Parameterized computational complexity of finding small-diameter subgraphs
- Cluster graph modification problems
- Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule?
- On the tractability of finding disjoint clubs in a network
- Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion
- The parametric complexity of graph diameter augmentation
- Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics
- Hardness of r-dominating set on Graphs of Diameter (r + 1)
- On Editing Graphs into 2-Club Clusters
- Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width
- A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing
- Kernelization Lower Bounds by Cross-Composition
- Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
- Cluster Editing
- Covering a Graph with Clubs
- Parameterized Algorithms
- On the tractability of covering a graph with 2-clubs
This page was built for publication: On 2-clubs in graph-based data clustering: theory and algorithm engineering
