A fully distributed (minimal) spanning tree algorithm

Lavallée, Ivan; Roucairol, Gérard

doi:10.1016/0020-0190(86)90043-8

Cited by 31 publications

(10 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A simple generalization of this technique achieves an 2m + 3n log k + O(n) leader finding algorithm for general undirected networks; the message complexity of that algorithm is better than that of the algorithms in [GHS83,KM86]. Our results for general networks are applicable also for different models such as the one appearing in [LR86] (and in fact improve their result).…”

Section: Introductionmentioning

confidence: 62%

“…In [LR86] a model in which each node knows its neighbors, and messages are permitted to be arbitrarily long, is considered (we call this model "neighborhood knowledge"). The annexing token in this case can carry the whole description of its DFS tree, and thus to avoid the traversing of back edges.…”

Section: Application In a Neighborhood-knowledge Modelmentioning

confidence: 99%

“…The complexity of this traversal is O(n), which yields, using our leader finding method, a 3n log n + O(n) leader finding algorithm. The algorithm of [LR86] is claimed there to have this message complexity only for the av erage case. The worst case message complexity in [LR86] is said to be O(n 2 ).…”

Section: Application In a Neighborhood-knowledge Modelmentioning

confidence: 99%

“…The algorithm of [LR86] is claimed there to have this message complexity only for the av erage case. The worst case message complexity in [LR86] is said to be O(n 2 ).…”

Section: Application In a Neighborhood-knowledge Modelmentioning

confidence: 99%

“…In [LR86] a spanning tree construction algorithm is presented for the case were each node knows its neighbors, and messages are permitted to be very long. It is claimed there that the message complexity of that algorithm is 3 n log n + O(n) (independent of m) for the average case.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

A modular technique for the design of efficient distributed leader finding algorithms

Korach

Kutten

Moran³

1990

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

A general, modular technique for designing efficient leader finding algorithms in distributed, asynchronous networks is developed. This technique reduces the relatively complex problem of efficient leader finding to a simpler problem of efficient serial traversing of the corresponding network. The message complexity of the resulting leader finding algorithms is bounded by (where n is the number of nodes in the network [m is the number of edges in the network], k is the number of nodes that start the algorithm, and f (n) [ f (m)] is the message complexity of traversing the nodes [edges] of the network. This technique does not require that the FIFO discipline is obeyed by the links. The local memory needed for each node, besides the memory needed for the traversal algorithm, is logarithmic in the maximal identity of a node in the network. This result achieves in a unified way the best known upper bounds on the message complexity of leader finding algorithms for circular, complete and general networks. It is also shown to be applicable to other classes of networks, and in some cases the message complexity of the resulted algorithms is better by a constant factor than that of previously known algorithms.

show abstract

Section: Introductionmentioning

confidence: 62%

Section: Application In a Neighborhood-knowledge Modelmentioning

confidence: 99%

Section: Application In a Neighborhood-knowledge Modelmentioning

confidence: 99%

“…The algorithm of [LR86] is claimed there to have this message complexity only for the av erage case. The worst case message complexity in [LR86] is said to be O(n 2 ).…”

Section: Application In a Neighborhood-knowledge Modelmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations