A parallel algorithm for routing: Best solutions at low computational costs

Geomatica

Volumn 51, Issue 1, 1997, Pages 45-51

  Karimi, Hassan A ^a,c   Hwang, Dongming ^a,b,d  

^a MCNC   (United States)

^b IBM   (United States)

^c NORTH CAROLINA STATE UNIVERSITY   (United States)

^d IBM MICROELECTRONICS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3343011977     PISSN: 11951036     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (13)

1. Dijkstra, E.W. 1959. A note on two problems in connexion with graphs. Numerische Mathematik, l, pp. 269-271.
2. Ding, Y., P.J. Densham, and M.P. Armstrong. 1992. Parallel Processing for Network Analysis: Decomposing Shortest Path Algorithms for MIMD Computers. Proceedings: 5th International Symposium on Data Handling, Charleston, SC, pp. 682-691.
3. Frederickson, G.N. 1991. Planar Graph Decomposition and All Pairs Shortest Paths. Journal of the Association of Computing Machinery, 38(1), pp. 162-204.
4. Gallo, G. and S. Pallotino. 1988. Shortest Path Algorithms. Annals of Operations Research, 13, pp. 379.
5. Gilbert, J.R. and E. Zmijewski. 1987. A Parallel Graph Partitioning Algorithm for a Message-Passing Multiprocessor. International Journal of Parallel Programming, pp. 16, 427-449.
6. Hong, C., L.S. Narasimhan, and H.D. Ratliff. 1991. Finding the shortest path in huge planar networks. PDRC Report Series 91-04, Georgia Institute of Technology, Atlanta, GA.
7. Karimi, H. A. 1996. Real-time optimal-route computation: A heuristic approach. ITS Journal, 3(2), pp. 111-127.
8. Mateti, P. and N. Deo. 1981. Parallel algorithms for the single source shortest path problem. Technical Report CS-81-078, Computer Science Department, Washington Sate University, Pullman, WA.
9. Moret, B.M.E., and H.D. Shapiro. 1990. Algorithms from P to NP, Volume I, Design & Efficiency. Redwood City, CA, Benjamin/Cummings Publishing Company, Inc.
10. Nilsson, N.J. 1980. Principles of Artificial Intelligence. Palo Alto, CA, Tioga Publishing Co.
11. Price, C.C. 1982. A VLSI algorithm for shortest path through a directed acyclic graph. Congress Numerantium, 34, pp. 363-371.
12. Smith, T.R., G. Peng, and P. Gahinet, 1989, Asynchronous, iterative, and parallel procedures for solving the weighted-region least cost path problem. Geographical Analysis, 21, pp. 147-166.
13. Treleaven, P.C. 1988. Parallel architecture overview. Parallel Computing, 8, pp. 59-70.