- Bliv medlem
-
Du er ikke logget ind
Log ind Opret dig
Du er ikke logget ind
Beskrivelse
Self-stabilization is a general approach to design a system to tolerate arbitrary transient faults. This thesis presents new time- and space-efficient self-stabilizing algorithms for well-known problems in graph theory and provides new complexity analyzes for existing algorithms. The main focus of this thesis is on the proof techniques used in the complexity analyzes and the design of the algorithms.
