Frank Bauernöppel

collaborators

2 papers

cs.DS2026

Enumerating Length-Bounded Simple Paths and Cycles in Directed Graphs with $O (k (n + m))$ Delay Using Edge-Consistent Node Barriers

Frank Bauernöppel, Jörg-Rüdiger Sack

Enumerating simple paths and cycles subject to a given length bound is a fundamental problem in graph algorithms. Recent algorithms, namely BC-DFS (Peng et al. 2019, 2021) and CYCL…

cs.DS2025

Finding All Bounded-Length Simple Cycles in a Directed Graph -- Revisited

Frank Bauernöppel, Jörg-Rüdiger Sack

In 2021, Gupta and Suzumura proposed a novel algorithm for enumerating all bounded-length simple cycles in directed graphs (arXiv:2105.10094). In this work, we present a concrete c…

Enumerating Length-Bounded Simple Paths and Cycles in Directed Graphs with O(k(n+m)) Delay Using Edge-Consistent Node Barriers

Finding All Bounded-Length Simple Cycles in a Directed Graph -- Revisited

Enumerating Length-Bounded Simple Paths and Cycles in Directed Graphs with $O (k (n + m))$ Delay Using Edge-Consistent Node Barriers