Kernelization in almost linear time for clustering into bounded vertex cover components
From MaRDI portal
Cites work
- A faster algorithm for vertex cover parameterized by solution size
- A kernelization algorithm for \(d\)-hitting set
- A near-optimal planarization algorithm
- A survey of parameterized algorithms and the complexity of edge modification
- Additive approximation for edge-deletion problems
- Algorithmic graph theory and perfect graphs
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- An improved kernelization algorithm for \(r\)-set packing
- Breaking a graph into connected components with small dominating sets
- Chordal editing is fixed-parameter tractable
- Cluster editing with locally bounded modifications
- Edge-Deletion Problems
- Fixed-parameter algorithms for cluster vertex deletion
- Graph Classes: A Survey
- Graph theory
- Graph-Theoretic Concepts in Computer Science
- scientific article; zbMATH DE number 5485473 (Why is no real title available?)
- Interval deletion is fixed-parameter tractable
- Kernelization. Theory of parameterized preprocessing
- LP can be a cure for parameterized problems
- Near-optimal algorithms for point-line covering problems
- Nearly time-optimal kernelization algorithms for the line-cover problem with big data
- Nondeterminism within $P^ * $
- Parameterized algorithms
- Parameterized graph separation problems
- Polynomial-time algorithm for maximum independent set in bounded-degree graphs with no long induced claws
- Properties of vertex packing and independence system polyhedra
- The node-deletion problem for hereditary properties is NP-complete
- Towards optimal and expressive kernelization for \(d\)-hitting set
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter
- Vertex cover: Further observations and further improvements
- Which problems have strongly exponential complexity?
This page was built for publication: Kernelization in almost linear time for clustering into bounded vertex cover components
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310182)
