3 papers
cs.DM2026
Graphs with Bounded Push-Pop Walk Orderings
Antoine Amarilli, Claire David, Nadime Francis +3
Consider a directed graph G and the (generally infinite) set Walks(G) of the walks in that graph. We are interested in ordering Walks(G) as w1, w2,... in a way that ensures that ea…
cs.DS2026
Gray Codes With Constant Delay and Constant Auxiliary Space
Antoine Amarilli, Claire David, Nadime Francis +3
We give the first two algorithms to enumerate all binary words of (like Gray codes) while ensuring that the delay and the auxiliary space is independent from ,…
cs.DS2023
Distinct Shortest Walk Enumeration for RPQs
Claire David, Nadime Francis, Victor Marsault
We consider the Distinct Shortest Walks problem. Given two vertices and of a graph database and a regular path query, enumerate all walks of minimal length fr…