Blazing a Trail via Matrix Multiplications: A Faster Algorithm for Non-shortest Induced Paths

Abstract

For vertices $u$ and $v$ of an $n$-vertex graph $G$, a $uv$-trail of $G$ is an induced $uv$-path of $G$ that is not a shortest $uv$-path of $G$. Berger, Seymour, and Spirkl [Discrete Mathematics 2021] gave the previously only known polynomial-time algorithm, running in $O(n^{18})$ time, to either output a $uv$-trail of $G$ or ensure that $G$ admits no $uv$-trail. We reduce the complexity to the time required to perform a poly-logarithmic number of multiplications of $n^2\times n^2$ Boolean matrices, leading to a largely improved $O(n^{4.75})$-time algorithm.

arXiv comment18 pages, 6 figures, a preliminary version appeared in STACS 2022

References in corpus (7)

• A Refined Laser Method and Faster Matrix Multiplication
• Three-in-a-Tree in Near Linear Time
• A Faster Algorithm to Recognize Even-Hole-Free Graphs
• The $k$-in-a-tree problem for graphs of girth at least~$k$
• The (theta, wheel)-free graphs Part IV: induced paths and cycles
• Finding a Shortest Even Hole in Polynomial Time
• Graphs with all holes the same length