Finding euler circuits in logarithmic parallel time

Authors:
B. Awerbuch;A. Israeli;Y. Shiloach
Affiliations:
-;-;-
Venue:
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Year:
1984

Citing 1
Cited 3

Graph Algorithms

Graph Algorithms

Are search and decision programs computationally equivalent?

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Parallel symmetry-breaking in sparse graphs

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Simulating (logcn)-wise independence in NC

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

A parallel algorithm for finding Euler circuits in graphs is presented. Its depth is log |E| and it employs |E| processors. The computational model considered is the PRAM (the shared memory model). This algorithm is a nice example of utilizing another parallel algorithm that does not seem to be closely related to our problem, namely the algorithm for finding the connected components and a spanning forest of an undirected graph.