Finding euler circuits in logarithmic parallel time

1 January 1984

proceedings article
Published by Association for Computing Machinery (ACM)

p. 249-257
https://doi.org/10.1145/800057.808688

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.

Keywords

PARALLEL ALGORITHM
LOGARITHMIC PARALLEL TIME
UNDIRECTED GRAPH
EULER CIRCUIT
CONNECTED COMPONENT
NICE EXAMPLE
COMPUTATIONAL MODEL
SHARED MEMORY MODEL
COMPUTER MODEL
COMPACTNESS
SHARED MEMORY
ALGORITHM

This publication has 0 references indexed in Scilit: