On the parameterized complexity of contraction to generalization of trees
From MaRDI portal
Publication:2000005
Recommendations
Cites work
- scientific article; zbMATH DE number 1261820 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 6862097 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Contracting few edges to remove forbidden induced subgraphs
- Deterministic parameterized connected vertex cover
- Edge-contraction problems
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Fundamentals of parameterized complexity
- Improved kernel results for some FPT problems based on simple observations
- Infeasibility of instance compression and succinct PCPs for NP
- Kernel bounds for disjoint cycles and disjoint paths
- Lossy kernelization
- Obtaining a bipartite graph by contracting few edges
- Obtaining planarity by contracting few edges
- On problems without polynomial kernels
- On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges
- On the NP-hardness of edge-deletion and -contraction problems
- On the removal of forbidden graphs by edge-deletion or by edge- contraction
- Parameterized algorithms
- Parameterized complexity of three edge contraction problems with degree constraints
- Parametrized complexity theory.
- Paths to trees and cacti
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
Cited in
(13)- Lossy kernels for graph contraction problems
- On the Parameterized Complexity of Maximum Degree Contraction Problem.
- On the parameterized complexity of contraction to generalization of trees
- An FPT algorithm for contraction to cactus
- Reducing the vertex cover number via edge contractions
- Lossy kernelization of same-size clustering
- On the parameterized complexity of maximum degree contraction problem
- \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms
- A single exponential-time FPT algorithm for cactus contraction
- Contracting to a longest path in H-free graphs
- On the parameterized complexity of grid contraction
- Paths to trees and cacti
- Paths to trees and cacti
This page was built for publication: On the parameterized complexity of contraction to generalization of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2000005)
