๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs

โœ Scribed by Jacob, Riko; Ritscher, Stephan; Scheideler, Christian; Schmid, Stefan

Book ID
119375381
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
311 KB
Volume
457
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A self-stabilizing distributed algorithm
A self-stabilizing distributed algorithm for minimal spanning tree problem in a symmetric graph
โœ G. Antonoiu; P.K. Srimani ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 640 KB

Minimal Spanning Tree (MST) problem in an arbitrary undirected graph is an important problem in graph theory and has extensive applications. Numerous algorithms are available to compute an MST. Our purpose here is to propose a self-stabilizing distributed algorithm for the MST problem and to prove i