Fixed-parameter algorithms for cluster vertex deletion
From MaRDI portal
Publication:987386
Recommendations
Cites work
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- A More Effective Linear Kernelization for Cluster Editing
- A general method to speed up fixed-parameter-tractable algorithms
- Aggregating inconsistent information
- Algorithms and experiments for parameterized approaches to hard graph problems
- An approximation algorithm for feedback vertex sets in tournaments
- Applying modular decomposition to parameterized cluster editing problems
- Automated generation of search tree algorithms for hard graphs modification problems
- Cluster graph modification problems
- Correlation clustering with a fixed number of clusters
- Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
- Efficient Parameterized Preprocessing for Cluster Editing
- Faster Scaling Algorithms for Network Problems
- Finding odd cycle transversals.
- Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Going Weighted: Parameterized Algorithms for Cluster Editing
- Graph-modeled data clustering: Exact algorithms for clique generation
- Improved Parameterized Upper Bounds for Vertex Cover
- Iterative Compression and Exact Algorithms
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems
- Kernelization Algorithms for d-Hitting Set Problems
- Kernels: Annotated, Proper and Induced
- On efficient fixed-parameter algorithms for weighted vertex cover
- On the hardness of approximating minimization problems
- Parameterized Algorithms for Hitting Set: The Weighted Case
- Parameterized algorithms for feedback set problems and their duals in tournaments
- The Cluster Editing Problem: Implementations and Experiments
- The disjoint cliques problem
- The node-deletion problem for hereditary properties is NP-complete
Cited in
(56)- A fast branching algorithm for cluster vertex deletion
- Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics
- Optimal-size problem kernels for \(d\)-Hitting Set in linear time and space
- scientific article; zbMATH DE number 7559376 (Why is no real title available?)
- Dominator coloring and CD coloring in almost cluster graphs
- Algorithms for 2-club cluster deletion problems using automated generation of branching rules
- On Making Directed Graphs Transitive
- Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes
- A fixed-parameter algorithm for the vertex cover \(P_3\) problem
- Fixed-Parameter Algorithms for Graph-Modeled Date Clustering
- \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs
- Approximation and tidying -- a problem kernel for s-plex cluster vertex deletion
- On making directed graphs transitive
- Algorithms and complexity of \(s\)-club cluster vertex deletion
- Orientable burning number of graphs
- Structural parameterizations of vertex integrity (best paper)
- A more fine-grained complexity analysis of finding the most vital edges for undirected shortest paths
- Parameterized algorithms for min-max 2-cluster editing
- Constant thresholds can make target set selection tractable
- A tight approximation algorithm for the cluster vertex deletion problem
- A tight approximation algorithm for the cluster vertex deletion problem
- A polynomial kernel for 3-leaf power deletion
- Reducing rank of the adjacency matrix by graph modification
- An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion
- \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs
- On 2-clubs in graph-based data clustering: theory and algorithm engineering
- On 2-clubs in graph-based data clustering: theory and algorithm engineering
- Fixed-parameter tractable distances to sparse graph classes
- Parameterized algorithms for cluster vertex deletion on degree-4 graphs and general graphs
- Even faster parameterized cluster deletion and cluster editing
- Polyhedral properties of the induced cluster subgraphs
- The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs
- A golden ratio parameterized algorithm for cluster editing
- The maximum independent union of cliques problem: complexity and exact approaches
- Faster parameterized algorithm for cluster vertex deletion
- Alternative parameterizations for cluster editing
- Recognizing map graphs of bounded treewidth
- Fixed-Parameter Algorithms for Cluster Vertex Deletion
- An FPT algorithm for the vertex cover \(P_4\) problem
- Confronting intractability via parameters
- Algorithmic meta-theorems for combinatorial reconfiguration revisited
- A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
- Asymptotic bounds for clustering problems in random graphs
- Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU
- Cluster vertex deletion: a parameterization between vertex cover and clique-width
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
- Reducing rank of the adjacency matrix by graph modification
- Towards optimal and expressive kernelization for \(d\)-hitting set
- Kernelization through Tidying
- Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs
- Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions
- Structural parameterizations of vertex integrity
- A fast branching algorithm for cluster vertex deletion
- An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem
- Learning driven three-phase search for the maximum independent union of cliques problem
- The firefighter problem: further steps in understanding its complexity
This page was built for publication: Fixed-parameter algorithms for cluster vertex deletion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987386)
