A 2 · |E|-bit distributed algorithm for the directed Euler trail problem

https://doi.org/10.1016/0020-0190(93)90155-3Get rights and content

Abstract

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.

References (6)

  • J. Ebert

    Computing Eulerian trails

    Inform. Process. Lett.

    (1988)
  • B. Awerbach et al.

    A tradeoff between information & knowledge in broadcast protocols

    J. ACM

    (1990)
  • C. Hierholzer

    Ueber die Moglichkeit, einen Linenzung ohne wieder holung und ohne unter brechnung zu umfahrem

    Math. Ann.

    (1873)
There are more references available in the full text version of this article.

Cited by (0)

View full text