Hauck, BerndBerndHauck2008-10-212008-10-212008http://tubdok.tub.tuhh.de/handle/11420/439Recently, Srimani and Xu presented a self-stabilizing algorithm that computes a weakly connected minimal dominating set. They prove an upper bound of O(2^n) until stabilization but they do not provide a lower bound. This paper verifies by giving an example that their algorithm indeed requires O(2^n) moves on a certain graph.enhttp://doku.b.tu-harburg.de/doku/lic_mit_pod.phpself-stabilizationweakly connected minimal dominating setcomplexity analysisTechnical Reporturn:nbn:de:gbv:830-tubdok-512610.15480/882.437FehlertoleranzVerteilter AlgorithmusANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY (B.6-7, F.1.3)11420/43910.15480/882.437930767881Technical Report