Parameterized algorithms for list \(K\)-cycle
From MaRDI portal
Publication:666679
DOI10.1007/s00453-018-0469-7zbMath1418.68106OpenAlexW2809500103WikidataQ129624068 ScholiaQ129624068MaRDI QIDQ666679
Saket Saurabh, Fahad Panolan, Meirav Zehavi
Publication date: 11 March 2019
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-018-0469-7
Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constrained multilinear detection and generalized graph motifs
- On finding rainbow and colorful paths
- Fundamentals of parameterized complexity
- Representative families: a unified tradeoff-based approach
- Algorithm engineering for color-coding with applications to signaling pathway detection
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time
- The directed subgraph homeomorphism problem
- The subgraph homeomorphism problem
- Detecting cycles through three fixed vertices in a graph
- A probabilistic remark on algebraic program testing
- Graph minors. XIII: The disjoint paths problem
- Algorithms for topology-free and alignment network queries
- Narrow sieves for parameterized paths and packings
- Parameterized Algorithms for Module Motif
- Improved Parameterized Algorithms for Network Query Problems
- Abusing the Tutte Matrix: An Algebraic Instance Compression for the K-set-cycle Problem
- Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms
- Spotting Trees with Few Leaves
- Mixing Color Coding-Related Techniques
- An Improved Algorithm for Finding Cycles Through Elements
- Faster Algebraic Algorithms for Path and Packing Problems
- Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- On Linear Time Minor Tests with Depth-First Search
- Color-coding
- On Problems as Hard as CNF-SAT
- Representative Families of Product Families
- Engineering Motif Search for Large Graphs
- Determinant Sums for Undirected Hamiltonicity
- Parameterized Algorithms
This page was built for publication: Parameterized algorithms for list \(K\)-cycle
