Finding biconnected componemts and computing tree functions in logarithmic parallel time

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 concurrent-read,...

Full description

Bibliographic Details

Published in:	25th Annual Symposium onFoundations of Computer Science, 1984 pp. 12 - 20
Main Authors:	Tarjan, R.E., Vishkin, U.
Format:	Conference Proceeding
Language:	English
Published:	IEEE 1984
Subjects:	Computational modeling Computer science Concurrent computing Parallel algorithms Phase change random access memory Random access memory Read-write memory Tree graphs US Department of Energy Writing
ISBN:	081860591X, 9780818605918
ISSN:	0272-5428
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!