Journal of applied mathematics & informatics
- Volume 17 Issue 1_2_3
- /
- Pages.1-23
- /
- 2005
- /
- 2734-1194(pISSN)
- /
- 2234-8417(eISSN)
AN OPTIMAL PARALLEL ALGORITHM FOR SOLVING ALL-PAIRS SHORTEST PATHS PROBLEM ON CIRCULAR-ARC GRAPHS
- SAHA ANITA (Vidyasagar University) ;
- PAL MADHUMANGAL (Vidyasagar University) ;
- PAL TAPAN K. (Vidyasagar University)
- Published : 2005.01.01
Abstract
The shortest-paths problem is a fundamental problem in graph theory and finds diverse applications in various fields. This is why shortest path algorithms have been designed more thoroughly than any other algorithm in graph theory. A large number of optimization problems are mathematically equivalent to the problem of finding shortest paths in a graph. The shortest-path between a pair of vertices is defined as the path with shortest length between the pair of vertices. The shortest path from one vertex to another often gives the best way to route a message between the vertices. This paper presents an
Keywords
- Design of algorithms;
- analysis of algorithms;
- parallel algorithms;
- interval tree;
- shortest-paths;
- circular-arc graph