Pages that link to "Item:Q987386"
From MaRDI portal
The following pages link to Fixed-parameter algorithms for cluster vertex deletion (Q987386):
Displayed 32 items.
- A fast branching algorithm for cluster vertex deletion (Q255285) (← links)
- Reducing rank of the adjacency matrix by graph modification (Q344771) (← links)
- On making directed graphs transitive (Q414917) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- A fixed-parameter algorithm for the vertex cover \(P_3\) problem (Q477591) (← links)
- Towards optimal and expressive kernelization for \(d\)-hitting set (Q486984) (← links)
- Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions (Q494805) (← links)
- Approximate association via dissociation (Q505447) (← links)
- An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem (Q511682) (← links)
- The firefighter problem: further steps in understanding its complexity (Q527402) (← links)
- An FPT algorithm for the vertex cover \(P_4\) problem (Q906446) (← links)
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion (Q1672007) (← links)
- The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs (Q1756342) (← links)
- Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes (Q1928521) (← links)
- A golden ratio parameterized algorithm for cluster editing (Q1932356) (← links)
- Even faster parameterized cluster deletion and cluster editing (Q1944120) (← links)
- Polyhedral properties of the induced cluster subgraphs (Q2022509) (← links)
- Faster parameterized algorithm for cluster vertex deletion (Q2035480) (← links)
- The maximum independent union of cliques problem: complexity and exact approaches (Q2174276) (← links)
- Improved approximation algorithms for hitting 3-vertex paths (Q2191773) (← links)
- Optimal-size problem kernels for \(d\)-Hitting Set in linear time and space (Q2203595) (← links)
- Constant thresholds can make target set selection tractable (Q2254488) (← links)
- Fixed-parameter tractable distances to sparse graph classes (Q2408199) (← links)
- Parameterized algorithms for min-max 2-cluster editing (Q2410027) (← links)
- Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion (Q2429325) (← links)
- Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics (Q2827798) (← links)
- Alternative Parameterizations for Cluster Editing (Q3075528) (← links)
- On Making Directed Graphs Transitive (Q3183483) (← links)
- Reducing Rank of the Adjacency Matrix by Graph Modification (Q3196399) (← links)
- A more fine‐grained complexity analysis of finding the most vital edges for undirected shortest paths (Q4628044) (← links)
- A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems (Q5895104) (← links)
- A tight approximation algorithm for the cluster vertex deletion problem (Q5918432) (← links)