Enumerating all geodesics
<|reference_start|>Enumerating all geodesics: By "geodesic" we mean any sequence of vertices $(v_1,v_2,...,v_k)$ of a graph $G$ that constitute a shortest path from $v_1$ to $v_k$. We propose a novel, output-polynomial algorithm to enumerate all geodesics of $G$. The graph can be directed or not, and weighted or not.<|reference_end|>
@article{wild2024enumerating,
    title={Enumerating all geodesics},
    author={Marcel Wild},
    journal={arXiv preprint arXiv:2409.16955},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.16955},
    primaryClass={math.CO cs.DM}
}