Enumerating m-Length Walks in Directed Graphs with Constant Delay
CoRR(2024)
摘要
In this paper, we provide a novel enumeration algorithm for the set of all
walks of a given length within a directed graph. Our algorithm has worst-case
constant delay between outputting succinct representations of such walks, after
a preprocessing step requiring linear time relative to the size of the graph.
We apply these results to the problem of enumerating succinct representations
of the strings of a given length from a prefix-closed regular language
(languages accepted by a finite automaton which has final states only).
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要