A distributed algorithm for constructing an Eulerian tour

@inproceedings{2004ADA,
  title={A distributed algorithm for constructing an Eulerian tour},
  author={Ș. and Majid Makki},
  year={2004}
}
We present an efficient distributed algorithm for constructing an Eulerian tour in a network. To construct an Eulerian circuit the algorithm requires (1 + r)(IEI + IVl) messages and time units, where IEI is the number of the communication links, IVl is the number of the nodes in the underlying network graph, and 0 5 r < 1 . The value of r depends on the network topology and on the chosen traversal path. In the best case, when r = 0 the algorithm only requires (IEI + IVl) messages and time units… CONTINUE READING