A randomized algorithm for long directed cycle

DOI10.1016/j.ipl.2016.02.005zbMath1356.68264arXiv1510.08892OpenAlexW2964052962MaRDI QIDQ264199

Meirav Zehavi

Publication date: 6 April 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.08892

zbMATH Keywords

algorithms\(k\)-pathparameterized complexitylong directed cycle

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)

Related Items (4)

Going Far from Degeneracy ⋮ Unnamed Item ⋮ On the complexity of finding internally vertex-disjoint long directed paths ⋮ Long directed \((s,t)\)-path: FPT algorithm

Cites Work

• Unnamed Item
• Finding paths of length \(k\) in \(O^{*}(2^k)\) time
• Representative Sets of Product Families
• Representative Families: A Unified Tradeoff-Based Approach
• Mixing Color Coding-Related Techniques
• Nonconstructive tools for proving polynomial-time decidability
• Color-coding
• Finding a long directed cycle
• Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms
• Parameterized Algorithms

This page was built for publication: A randomized algorithm for long directed cycle