Finding Euler Circuits in Logarithmic Parallel Time

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).

Authors

• Baruch Awerbuch
• Amos Israeli
• Yossi Shiloach

Keywords

No keywords are indexed for this paper.