Enumerating all geodesics
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866915517866967040 |
|---|---|
| author | Wild, Marcel |
| author_facet | Wild, Marcel |
| contents | 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, natural algorithm to enumerate all geodesics of $G$, and pit it (using Mathematica) against the standard procedure for the task. The distance matrix $D(G)$ plays a crucial role in this. In fact, part of our article is devoted to survey its many uses in related tasks. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_16955 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Enumerating all geodesics Wild, Marcel Combinatorics Discrete Mathematics 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, natural algorithm to enumerate all geodesics of $G$, and pit it (using Mathematica) against the standard procedure for the task. The distance matrix $D(G)$ plays a crucial role in this. In fact, part of our article is devoted to survey its many uses in related tasks. |
| title | Enumerating all geodesics |
| topic | Combinatorics Discrete Mathematics |
| url | https://arxiv.org/abs/2409.16955 |