Paths to Trees and Cacti
From MaRDI portal
Publication:5283353
DOI10.1007/978-3-319-57586-5_4zbMath1486.68120OpenAlexW2606694986MaRDI QIDQ5283353
Lawqueen Kanesh, Akanksha Agrawal, 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
Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)
Related Items
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 ⋮ Contracting to a longest path in H-free graphs ⋮ On the Parameterized Complexity of Maximum Degree Contraction Problem. ⋮ On the parameterized complexity of contraction to generalization of trees ⋮ Parameterized complexity of maximum edge colorable subgraph
Cites Work
- Unnamed Item
- Unnamed Item
- Unit interval editing is fixed-parameter tractable
- Finding odd cycle transversals.
- Edge-contraction problems
- Chordal deletion is fixed-parameter tractable
- On the removal of forbidden graphs by edge-deletion or by edge- contraction
- Fixed-parameter tractability of graph modification problems for hereditary properties
- A polynomial kernel for trivially perfect editing
- On the NP-hardness of edge-deletion and -contraction problems
- Obtaining planarity by contracting few edges
- On the threshold of intractability
- Faster parameterized algorithms for deletion to split graphs
- Contracting graphs to paths and trees
- A faster FPT algorithm for bipartite contraction
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters
- Contracting Few Edges to Remove Forbidden Induced Subgraphs
- On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges
- Chordal Editing is Fixed-Parameter Tractable
- Parameterized Complexity of Vertex Deletion into Perfect Graph Classes
- Linear Recognition of Almost Interval Graphs
- Interval Deletion Is Fixed-Parameter Tractable
- Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
- Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT
- Obtaining a Bipartite Graph by Contracting Few Edges
- Subexponential Parameterized Algorithm for Minimum Fill-In
- Parameterized Algorithms
- A Subexponential Parameterized Algorithm for Proper Interval Completion
- A Subexponential Parameterized Algorithm for Proper Interval Completion
