Multiplicative Parameterization Above a Guarantee

DOI10.1145/3460956zbMath1495.68103OpenAlexW4200477517MaRDI QIDQ5868879

Meirav Zehavi, Petr A. Golovach, Fahad Panolan, Daniel Lokshtanov, Saket Saurabh, Fedor V. Fomin

Publication date: 24 September 2022

Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3460956

zbMATH Keywords

girthparameterized complexitylong cycleabove-guaranteemultiplicative above-guarantee

Mathematics Subject Classification ID

Parameterized complexity, tractability and kernelization (68Q27)

Related Items (2)

Detours in directed graphs ⋮ Methods for determining cycles of a specific length in undirected graphs with edge weights

This page was built for publication: Multiplicative Parameterization Above a Guarantee