Jörg-Rüdiger Sack

works on

cycles 1 delay analysis 1 directed graphs 1 enumeration 1 simple paths 1

From the 1 of 2 linked papers with an AI index.

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, Frank Bauernöppel, JÃ¶rg-RÃ¼diger Sack +1

The paper identifies flaws in existing algorithms for enumerating length-bounded simple paths and cycles in directed graphs and introduces a new O(k(n+m)) delay algorithm (BS-DFS)…

cs.DS2026

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