FINDING BICONNECTED COMPONENTS AND COMPUTING TREE FUNCTIONS IN LOGARITHMIC PARALLEL TIME.

Robert E. Tarjan, Uzi Vishkin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

69 Scopus citations

Abstract

A new algorithm is proposed for finding the blocks (biconnected components) of an undirected graph. A serial implementation runs in O(nm) time and space on a graph of n vertices and m edges. A parallel implementation runs in O(log n) time and O(nm) space using O(nm) processors on a concurrent-read, concurrent-write parallel RAM. An alternative implementation runs in O(n**2 /p) time and O(n**2 ) space using any number p less than equivalent to n**2 /log**2 n of processors, on a concurrent-read, exclusive-write parallel RAM. The latter algorithm has optimal speed-up, assuming an adjacency matrix representation of the input.

Original languageEnglish (US)
Title of host publicationAnnual Symposium on Foundations of Computer Science (Proceedings)
PublisherIEEE
Pages12-20
Number of pages9
ISBN (Print)081860591X
StatePublished - Dec 1 1984
Externally publishedYes

Publication series

NameAnnual Symposium on Foundations of Computer Science (Proceedings)
ISSN (Print)0272-5428

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

Fingerprint Dive into the research topics of 'FINDING BICONNECTED COMPONENTS AND COMPUTING TREE FUNCTIONS IN LOGARITHMIC PARALLEL TIME.'. Together they form a unique fingerprint.

  • Cite this

    Tarjan, R. E., & Vishkin, U. (1984). FINDING BICONNECTED COMPONENTS AND COMPUTING TREE FUNCTIONS IN LOGARITHMIC PARALLEL TIME. In Annual Symposium on Foundations of Computer Science (Proceedings) (pp. 12-20). (Annual Symposium on Foundations of Computer Science (Proceedings)). IEEE.