Eulerian tour construction in a distributed environment

Authors:
S. A. M. Makki
Affiliations:
Royal Melbourne Institute of Technology, Melbourne 3000, Australia
Venue:
Computer Communications
Year:
1999

Citing 4
Cited 0

Algorithmic graph theory

Algorithmic graph theory
Distributed algorithms for depth-first search

Information Processing Letters
Graph Algorithms

Graph Algorithms
Graph theory: An algorithmic approach (Computer science and applied mathematics)

Graph theory: An algorithmic approach (Computer science and applied mathematics)

Quantified Score

Hi-index	0.24

Visualization

Abstract

We present an efficient distributed algorithm for constructing an Eulerian tour in a distributed environment. This algorithm requires (1+r)(|E|+|V|) messages and time units for constructing an Eulerian circuit, where |E| is the number of the communication links, |V| the number of the nodes in the underlying network graph, and 0@?r