摘要
A new distributed Euler trail algorithm is proposed to run on an Euler diagraph G(V,E) where each node knows only its adjacent edges, converting it into a new state that each node knows how an existent Euler trail routes through its incoming and outgoing edges. The communication requires only 2middot;|E| one-bit messages. The algorithm can be used as a building block for solving other distributed graph problems, and can be slightly modified to run on a strongly-connected diagraph for generating the existent Euler trail or to report that no Euler trails exist. © 1993.