Parameterized algorithms for list \(K\)-cycle

DOI10.1007/s00453-018-0469-7zbMath1418.68106MaRDI QIDQ666679

Meirav Zehavi, Saket Saurabh, Fahad Panolan

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

zbMATH Keywords

\(k\)-path; parameterized complexity; colorful path; \(K\)-cycle

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C38: Paths and cycles

05C15: Coloring of graphs and hypergraphs

05C85: Graph algorithms (graph-theoretic aspects)

68W20: Randomized algorithms