Paths to trees and cacti
From MaRDI portal
Publication:5283353
DOI10.1007/978-3-319-57586-5_4zbMATH Open1486.68120OpenAlexW2606694986MaRDI QIDQ5283353FDOQ5283353
Authors: Akanksha Agrawal, Lawqueen Kanesh, Saket Saurabh, Prafullkumar Tale 
Publication date: 21 July 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-57586-5_4
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)
Cites Work
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- Finding odd cycle transversals.
- Title not available (Why is that?)
- Parameterized algorithms
- Chordal deletion is fixed-parameter tractable
- Linear kernels and single-exponential algorithms via protrusion decompositions
- Obtaining planarity by contracting few edges
- Chordal editing is fixed-parameter tractable
- Interval deletion is fixed-parameter tractable
- Obtaining a bipartite graph by contracting few edges
- Subexponential parameterized algorithm for minimum fill-in
- On the removal of forbidden graphs by edge-deletion or by edge- contraction
- On the NP-hardness of edge-deletion and -contraction problems
- Edge-contraction problems
- Contracting few edges to remove forbidden induced subgraphs
- On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges
- Linear recognition of almost interval graphs
- A Subexponential Parameterized Algorithm for Proper Interval Completion
- Faster parameterized algorithms for deletion to split graphs
- Exploring subexponential parameterized complexity of completion problems
- Parameterized complexity of vertex deletion into perfect graph classes
- Sparsification upper and lower bounds for graphs problems and not-all-equal SAT
- A subexponential parameterized algorithm for proper interval completion
Cited In (15)
- Trees, Paths, Stars, Caterpillars and Spiders
- Paths to trees and cacti
- An improved linear kernel for the cycle contraction problem
- An FPT algorithm for contraction to cactus
- Lossy kernels for graph contraction problems
- Path contraction faster than \(2^n\)
- On the parameterized complexity of contraction to generalization of trees
- On the parameterized complexity of maximum degree contraction problem
- Contracting to a longest path in H-free graphs
- On the Parameterized Complexity of Maximum Degree Contraction Problem.
- On the parameterized complexity of grid contraction
- A single exponential-time FPT algorithm for cactus contraction
- Parameterized complexity of maximum edge colorable subgraph
- On the parameterized complexity of contraction to generalization of trees
- Contracting graphs to paths and trees
This page was built for publication: Paths to trees and cacti
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283353)
