DocumentCode
3485952
Title
Parallel dynamic st-numbering and applications
Author
Dekel, E. ; Hu, Jie
Author_Institution
IBM Israel, Haifa, Israel
fYear
1993
fDate
13-16 Apr 1993
Firstpage
576
Lastpage
580
Abstract
Given an arbitrary st-numbering of a biconnected graph of n vertices and m edges, parallel algorithms for dynamically finding another st-numbering of any specified pair of vertices on EREW P-RAM are presented. The algorithms run in O(log n) time using m/logn processors on EREW P-RAM. The dynamic st-numbering is applied to some network problems such as bipartition, centroid trees and centered trees construction
Keywords
computational complexity; graph theory; parallel algorithms; EREW P-RAM; biconnected graph; bipartition; centered trees; centroid trees; parallel algorithms; st-numbering; time complexity; Computer science; Concurrent computing; Dynamic scheduling; Heuristic algorithms; IEL; Parallel algorithms; Partitioning algorithms; Processor scheduling; Routing; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing Symposium, 1993., Proceedings of Seventh International
Conference_Location
Newport, CA
Print_ISBN
0-8186-3442-1
Type
conf
DOI
10.1109/IPPS.1993.262815
Filename
262815
Link To Document