2 papers
cs.DC2024
Search for shortest paths based on a projective description of unweighted graphs
V. A. Melent'ev
The search is based on the preliminary transformation of matrices or adjacency lists traditionally used in the study of graphs into projections cleared of redundant information (re…
cs.DC2022
On the quick search for the shortest paths in an unweighted dynamic graph by its projections in brief
V. A. Melent'ev
For the first time proposed: a method for representing the projections of a graph in computer memory and a description based on it of a quick search for shortest paths in unweighte…