A fast branching algorithm for cluster vertex deletion
From MaRDI portal
Publication:255285
DOI10.1007/S00224-015-9631-7zbMATH Open1336.68192OpenAlexW2001878420WikidataQ59473167 ScholiaQ59473167MaRDI QIDQ255285FDOQ255285
Anudhyan Boral, Marcin Pilipczuk, Tomasz Kociumaka, Marek Cygan
Publication date: 9 March 2016
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-015-9631-7
Recommendations
- A fast branching algorithm for cluster vertex deletion
- Faster parameterized algorithm for cluster vertex deletion
- An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem
- Fixed-parameter algorithms for cluster vertex deletion
- Graph-modeled data clustering: Exact algorithms for clique generation
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Automated generation of search tree algorithms for hard graphs modification problems
- A golden ratio parameterized algorithm for cluster editing
- Applying modular decomposition to parameterized cluster editing problems
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- Clustering with qualitative information
- Linear time algorithms for graph search and connectivity determination on complement graphs.
- Kernels: Annotated, Proper and Induced
- A \(2k\) kernel for the cluster editing problem
- Cluster Editing
- Aggregating inconsistent information
- Exact exponential algorithms.
- Correlation clustering
- Finding odd cycle transversals.
- Cluster editing with locally bounded modifications
- A top-down approach to search-trees: Improved algorithmics for 3-hitting set
- Fixed-parameter algorithms for cluster vertex deletion
- A kernelization algorithm for \(d\)-hitting set
Cited In (33)
- Parameterized algorithms for the happy set problem
- Structural parameterizations of budgeted graph coloring
- Algorithms for 2-club cluster deletion problems using automated generation of branching rules
- Structural parameterizations of budgeted graph coloring
- \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs
- Computing densest \(k\)-subgraph with structural parameters
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization
- A tight approximation algorithm for the cluster vertex deletion problem
- A tight approximation algorithm for the cluster vertex deletion problem
- \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs
- On 2-clubs in graph-based data clustering: theory and algorithm engineering
- Parameterized algorithms for cluster vertex deletion on degree-4 graphs and general graphs
- Enumeration of maximal irredundant sets for claw-free graphs
- FPT and kernelization algorithms for the induced tree problem
- Revisiting connected vertex cover: FPT algorithms and lossy kernels
- Title not available (Why is that?)
- Polyhedral properties of the induced cluster subgraphs
- Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms
- Faster parameterized algorithm for cluster vertex deletion
- Title not available (Why is that?)
- Faster parameterized algorithms for two vertex deletion problems
- On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering
- A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths
- Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs
- FPT Algorithms for FVS Parameterized by Split and Cluster Vertex Deletion Sets and Other Parameters
- Approximate association via dissociation
- On the \(d\)-claw vertex deletion problem
- Perfectly matched sets in graphs: parameterized and exact computation
- Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization
- On independent cliques and linear complementarity problems
- Minimum eccentricity shortest path problem with respect to structural parameters
- Minimum eccentricity shortest path problem with respect to structural parameters
- Enumeration of Maximal Irredundant Sets for Claw-Free Graphs
This page was built for publication: A fast branching algorithm for cluster vertex deletion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q255285)
