Enumerating m-Length Walks in Directed Graphs with Constant Delay.

Duncan Adamson Pawel Gawrychowski Florin Manea

Published in: CoRR (2024)

Keyphrases

directed graph
random walk
directed acyclic graph
alphabet size
graph structure
strongly connected
maximum flow
bayesian networks
directed edges
data sets
finite alphabet
processor sharing
graph structures
path length
fixed length
maximum number
worst case
dynamic programming