Quick but odd growth of cacti
From MaRDI portal
Publication:2408205
DOI10.1007/S00453-017-0317-1zbMath1372.68136OpenAlexW2407089923MaRDI QIDQ2408205
Daniel Lokshtanov, Fahad Panolan, Sudeshna Kolay, Saket Saurabh
Publication date: 10 October 2017
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2015/5588/
Analysis of algorithms and problem complexity (68Q25) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)
Related Items (5)
Feedback Vertex Set and Even Cycle Transversal for $H$-Free Graphs: Finding Large Block Graphs ⋮ An improved deterministic parameterized algorithm for cactus vertex deletion ⋮ Odd Multiway Cut in Directed Acyclic Graphs ⋮ Faster deterministic algorithms for \textsc{Co-path Packing} and \textsc{Co-path/cycle Packing} ⋮ Faster deterministic algorithm for cactus vertex deletion
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- Unit interval editing is fixed-parameter tractable
- A single-exponential FPT algorithm for the \(K_4\)-\textsc{minor cover} problem
- The node-deletion problem for hereditary properties is NP-complete
- Hitting Forbidden Minors: Approximation and Kernelization
- The even-path problem for graphs and digraphs
- Uniform Kernelization Complexity of Hitting Forbidden Minors
- Hitting Diamonds and Growing Cacti
- On the presence of disjoint subgraphs of a specified type
- Modularity of cycles and paths in graphs
- Interval Deletion Is Fixed-Parameter Tractable
- Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
- (Meta) Kernelization
- Parameterized Algorithms for Even Cycle Transversal
- Subexponential Parameterized Algorithm for Minimum Fill-In
- Parameterized Algorithms
- Hitting and Harvesting Pumpkins
This page was built for publication: Quick but odd growth of cacti
