Enumerating m-Length Walks in Directed Graphs with Constant Delay
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866911748902092800 |
|---|---|
| author | Adamson, Duncan Gawrychowski, Pawel Manea, Florin |
| author_facet | Adamson, Duncan Gawrychowski, Pawel Manea, Florin |
| contents | 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). |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_02163 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Enumerating m-Length Walks in Directed Graphs with Constant Delay Adamson, Duncan Gawrychowski, Pawel Manea, Florin Data Structures and Algorithms 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). |
| title | Enumerating m-Length Walks in Directed Graphs with Constant Delay |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2401.02163 |