Finding Euler tours in parallel
The problem of finding Euler tours in directed and undirected Euler graphs is considered. O(log\(| V|)\) time algorithms are given using a linear number of processors on a concurrent-read concurrent-write parallel RAM.
concurrent-read concurrent-write parallel RAM
scientific article; zbMATH DE number 3880128