Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2307.15879 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910663553581056 |
|---|---|
| author | Melent'ev, V. A. |
| author_facet | Melent'ev, V. A. |
| contents | The method is based on the preliminary transformation of the traditionally used matrices or adjacency lists in the graph theory into refined projections free from redundant information, and their subsequent use in constructing shortest paths. Unlike adjacency matrices and lists based on enumerating binary adjacency relations, the refined projection is based on enumerating more complex relations: simple paths from a given graph vertex that are shortest. The preliminary acquisition of such projections reduces the algorithmic complexity of applications using them and improves their volumetric and real-time characteristics to linear ones for a pair of vertices. The class of graphs considered is extended to mixed graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2307_15879 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Shortest paths search method based on the projective description of unweighted mixed graphs Melent'ev, V. A. Distributed, Parallel, and Cluster Computing Combinatorics 52B05 G.2.2; F.1.3 The method is based on the preliminary transformation of the traditionally used matrices or adjacency lists in the graph theory into refined projections free from redundant information, and their subsequent use in constructing shortest paths. Unlike adjacency matrices and lists based on enumerating binary adjacency relations, the refined projection is based on enumerating more complex relations: simple paths from a given graph vertex that are shortest. The preliminary acquisition of such projections reduces the algorithmic complexity of applications using them and improves their volumetric and real-time characteristics to linear ones for a pair of vertices. The class of graphs considered is extended to mixed graphs. |
| title | Shortest paths search method based on the projective description of unweighted mixed graphs |
| topic | Distributed, Parallel, and Cluster Computing Combinatorics 52B05 G.2.2; F.1.3 |
| url | https://arxiv.org/abs/2307.15879 |