Finding longer cycles via shortest colourful cycle

TL;DR

This paper improves algorithms for finding long cycles through a specific edge in graphs, achieving faster runtimes than previous methods, especially in bipartite graphs, by refining the colourful cycle approach.

Contribution

It introduces a new, concise algorithm and analysis for the colourful cycle problem and provides tighter reductions for the $k,e$-Long Cycle problem, enhancing computational efficiency.

Findings

Achieves $1.731^k$ runtime for general graphs, better than $2^k$

Matches the fastest known $2^{k/2}$ runtime in bipartite graphs

Provides a shorter, self-contained proof of the colourful cycle algorithm

Abstract

We consider the parameterised $k,e$-Long Cycle problem, in which you are given an $n$-vertex undirected graph $G$, a specified edge $e$ in $G$, and a positive integer $k$, and are asked to decide if the graph $G$ has a simple cycle through $e$ of length at least $k$. We show how to solve the problem in $1.731^k\operatorname{poly}(n)$ time, improving over the $2^k\operatorname{poly}(n)$ time algorithm by [Fomin et al., TALG 2024], but not the more recent $1.657^k\operatorname{poly}(n)$ time algorithm by [Eiben, Koana, and Wahlstr\"om, SODA 2024]. When the graph is bipartite, we can solve the problem in $2^{k/2}\operatorname{poly}(n)$ time, matching the fastest known algorithm for finding a cycle of length exactly $k$ in an undirected bipartite graph [Bj\"orklund et al., JCSS 2017]. Our results follow the approach taken by [Fomin et al., TALG 2024], which describes an efficient algorithm for finding cycles using many colours in a vertex-coloured undirected graph. Our contribution is twofold. First, we describe a new algorithm and analysis for the central colourful cycle problem, with the aim of providing a comparatively short and self-contained proof of correctness. Second, we give tighter reductions from $k,e$-Long Cycle to the colourful cycle problem, which lead to our improved running times.