Parameterized Algorithms for List K-Cycle

DOI10.4230/LIPICS.FSTTCS.2016.22MaRDI QIDQ4636569zbMATH OpenOpenAlexFDO

Authors Fahad Panolan, Meirav Zehavi

Publication date 19 April 2018

Full work available at URL https://doi.org/10.4230/LIPIcs.FSTTCS.2016.22

zbMATH Keywords

\(K\)-cyclecolorful pathparameterized complexity

Mathematics Subject Classification ID

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

Recommendations

• Parameterized algorithms for list \(K\)-cycle
• Parameterized Approximability of the Disjoint Cycle Problem
• Parameterized algorithms for even cycle transversal
• Listing all fixed-length simple cycles in sparse graphs in optimal time
• scientific article; zbMATH DE number 1215999
• scientific article; zbMATH DE number 2077649
• Efficient algorithms for counting parameterized list H-colorings

Cited in

(3)

• Abusing the Tutte matrix: an algebraic instance compression for the K-set-cycle problem
• Quasipolynomial representation of transversal matroids with applications in parameterized complexity
• Parameterized algorithms for list \(K\)-cycle

This page was built for publication: Parameterized Algorithms for List K-Cycle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4636569)