| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 427170 | Information Processing Letters | 2013 | 6 Pages |
Abstract
•Efficient self-stabilizing algorithm for optimally efficient sets of graphs.•Improved run-time and lower memory requirement than existing algorithm.•Efficient self-stabilizing algorithm for computing efficiency of a tree.•Algorithms work under distributed unfair scheduler.
This paper presents distributed self-stabilizing algorithms to compute the efficiency of trees and optimally efficient sets of general graphs.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Volker Turau,