Finding long directed cycles is hard even when DFVS is small or girth is large

DOI10.4230/lipics.esa.2023.65MaRDI QIDQ6657027

Meirav Zehavi, Ashwin Jacob, Michał Włodarczyk

Publication date: 6 January 2025

zbMATH Keywords

Hamiltonian cycledirected graphslongest pathparameterized complexitydirected feedback vertex set

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: Finding long directed cycles is hard even when DFVS is small or girth is large