
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
25th Annual Symposium on Foundations of Computer Science (FOCS 1984)
Singer Island, FL
October 24October 26
ISBN: 081860591X
ASCII Text  x  
R.E. Tarjan, U. Vishkin, "Finding Biconnected Componemts And Computing Tree Functions In Logarithmic Parallel Time," 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 1220, 25th Annual Symposium on Foundations of Computer Science (FOCS 1984), 1984.  
BibTex  x  
@article{ 10.1109/SFCS.1984.715896, author = {R.E. Tarjan and U. Vishkin}, title = {Finding Biconnected Componemts And Computing Tree Functions In Logarithmic Parallel Time}, journal ={2013 IEEE 54th Annual Symposium on Foundations of Computer Science}, volume = {0}, year = {1984}, isbn = {081860591X}, pages = {1220}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1984.715896}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  CONF JO  2013 IEEE 54th Annual Symposium on Foundations of Computer Science TI  Finding Biconnected Componemts And Computing Tree Functions In Logarithmic Parallel Time SN  081860591X SP12 EP20 A1  R.E. Tarjan, A1  U. Vishkin, PY  1984 KW  parallel graph algorithm KW  biconnected components KW  blocks KW  spanning tree VL  0 JA  2013 IEEE 54th Annual Symposium on Foundations of Computer Science ER   
In this paper we propose a new algorithm for finding the blocks (biconnected components) of an undirected graph. A serial implementation runs in 0[n+m] time and space on a graph of n vertices and m edges. A parallel implmentation runs in 0[log n] time and 0[n+m] space using 0[n+m] processors on a concurrentread, concurrentwrite parallel RAM. An alternative implementation runs in 0[n/sup 2/p] time and 0[n/sup 2/] space using any number p /spl les/ n/sup 2/log/sup 2/n of processors, on a concurrentread, exclusivewrite parallel RAM. The latter algorithm has optimal speedup, assuming an adjacency matrix representation of the input. A general algorithmic technique which simplifies and improve computation of various functions on tress is introduced. This technique typically requires 0(log n) time using 0(n) space on an exclusiveread exclusivewrite parallel RAM.
Index Terms:
parallel graph algorithm, biconnected components, blocks, spanning tree
Citation:
R.E. Tarjan, U. Vishkin, "Finding Biconnected Componemts And Computing Tree Functions In Logarithmic Parallel Time," focs, pp.1220, 25th Annual Symposium on Foundations of Computer Science (FOCS 1984), 1984
Usage of this product signifies your acceptance of the Terms of Use.