𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Self-stabilizing algorithms for minimal global powerful alliance sets in graphs

✍ Scribed by Yahiaoui, Saïd; Belhoul, Yacine; Haddad, Mohammed; Kheddouci, Hamamache

Book ID
123118520
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
163 KB
Volume
113
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Comb
[Lecture Notes in Computer Science] Combinatorial Algorithms Volume 8288 || Linear-Time Self-stabilizing Algorithms for Minimal Domination in Graphs
✍ Lecroq, Thierry; Mouchard, Laurent 📂 Article 📅 2013 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 222 KB

This book constitutes the thoroughly refereed post-workshop proceedings of the 24th International Workshop on Combinatorial Algorithms, IWOCA 2013, held in Rouen, France, in July 2013. The 33 revised full papers presented together with 10 short papers and 5 invited talks were carefully reviewed and

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