DocumentCode :
3204876
Title :
Efficient parallel shortest path algorithms for k-chordal graphs
Author :
Mitra, Pinaki
Author_Institution :
Sch. of Comput. Sci., Simon Fraser Univ., Burnaby, BC, Canada
fYear :
1992
fDate :
23-26 Mar 1992
Firstpage :
88
Lastpage :
94
Abstract :
Presents parallel NC algorithms for all pair shortest path problem with optimal processor time product and single source shortest path problem with near optimal processor time product in k-chordal graphs. The algorithm for all pair problem runs in O(log2 n) time with O(n2/log2 n) processors. The single source problem runs with O( n) processors in O(log2 n) time. In both cases the author assumes CRCW PRAM model of computation
Keywords :
computational complexity; graph theory; parallel algorithms; k-chordal graphs; parallel NC algorithms; shortest path algorithms; Computational modeling; Parallel algorithms; Particle separators; Phase change random access memory; Shortest path problem; Terminology; Tree graphs;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel Processing Symposium, 1992. Proceedings., Sixth International
Conference_Location :
Beverly Hills, CA
Print_ISBN :
0-8186-2672-0
Type :
conf
DOI :
10.1109/IPPS.1992.223066
Filename :
223066
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=3204876
بازگشت