Self-stabilizing algorithms for efficient sets of graphs and trees

• 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.