A \(2^{O(k)}n\) algorithm for \(k\)-cycle in minor-closed graph families
From MaRDI portal
Publication:2006778
DOI10.1016/j.tcs.2020.07.034zbMath1455.68151arXiv2008.03131OpenAlexW3047530233MaRDI QIDQ2006778
Publication date: 12 October 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.03131
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)
Cites Work
- Unnamed Item
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs
- Catalan structures and dynamic programming in \(H\)-minor-free graphs
- Graph minors. XX: Wagner's conjecture
- Diameter and treewidth in minor-closed graph families
- Diameter and treewidth in minor-closed graph families, revisited
- Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
- Polynomial bounds for centered colorings on proper minor-closed graph classes
- Narrow sieves for parameterized paths and packings
- Planar Subgraph Isomorphism Revisited
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms
- Mixing Color Coding-Related Techniques
- Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphs
- Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms
- Smallest-last ordering and clustering and graph coloring algorithms
- Simple Constructions of Almost k-wise Independent Random Variables
- Color-coding
- Subgraph Isomorphism in Planar Graphs and Related Problems
This page was built for publication: A \(2^{O(k)}n\) algorithm for \(k\)-cycle in minor-closed graph families
