Title :
Shortest paths in regular grids
Author_Institution :
Dept. of Electr. Eng., New Brunswick Univ., Fredericton, NB, Canada
fDate :
10/1/1998 12:00:00 AM
Abstract :
Explicit expressions are obtained for the number of shortest-length paths between pairs of vertices in square grids, triangular grids and hexagonal grids. Occurrence probabilities are given for vertices and edges in randomly selected shortest paths
Keywords :
data flow graphs; multiprocessor interconnection networks; edge; hexagonal grid; linear graph; multiprocessor computational system; occurrence probability; shortest path; square grid; triangular grid; vertex;
Journal_Title :
Circuits, Devices and Systems, IEE Proceedings -
DOI :
10.1049/ip-cds:19982268
