On Finding Euler Tours in Parallel

We describe an alternative implementation of Atallah and Vishkin’s parallel algorithm for finding an Euler Tour of a graph. Instead of finding a spanning tree as an intermediate step, this algorithm is based on identifying a strut which is easier to compute. Using the strut, vertices which have more than one circuit passing through them are identified directly. Stitching at such vertices reduces the number of circuits in the Euler Partition.