DocumentCode
2034821
Title
Finding Articulation Points and Bridges of Permutation Graphs
Author
Ibarra, Oscar H. ; Zheng, Qi
Author_Institution
University of California, USA
Volume
3
fYear
1993
fDate
16-20 Aug. 1993
Firstpage
77
Lastpage
81
Abstract
We show that articulation points and bridges of permutation graphs can be found in O(logn) time using O(n/logn) processors on an EREW PRAM. The algorithms are optimal with respect to the time-processor product.
Keywords
Biological system modeling; Bridges; Computational biology; Genetics; Joining processes; Parallel algorithms; Parallel processing; Phase change random access memory; Pulse width modulation; Very large scale integration; EREW PRAM; articulation point; bridge; parallel algorithm; permutation graph;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing, 1993. ICPP 1993. International Conference on
Conference_Location
Syracuse, NY, USA
ISSN
0190-3918
Print_ISBN
0-8493-8983-6
Type
conf
DOI
10.1109/ICPP.1993.91
Filename
4134249
Link To Document