Finding Euler tours in parallel
作者：
Highlights：
•
摘要
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.
论文关键词：
论文评审过程：Received 19 October 1982, Revised 21 May 1984, Available online 2 December 2003.
论文官网地址：https://doi.org/10.1016/0022-0000(84)90003-5
