An Efficient Silent Self-Stabilizing Algorithm for 1-Maximal Matching in Anonymous Networks
暂无分享,去创建一个
[1] Sébastien Tixeuil,et al. A self-stabilizing 2/3-approximation algorithm for the maximum matching problem , 2011, Theor. Comput. Sci..
[2] Wayne Goddard,et al. An Anonymous Self-Stabilizing Algorithm for 1-Maximal Matching in Trees , 2006, PDPTA.
[3] Ajoy Kumar Datta,et al. Leader Election and Centers and Medians in Tree Networks , 2013, SSS.
[4] Pradip K. Srimani,et al. Maximal matching stabilizes in time O(m) , 2001, Inf. Process. Lett..
[5] Lisa Higham,et al. Dynamic and self-stabilizing distributed matching , 2002, PODC '02.
[6] Valmir Carneiro Barbosa,et al. An introduction to distributed algorithms , 1996 .
[7] Tatsuhiro Tsuchiya,et al. The Time Complexity of Hsu and Huang's Self-Stabilizing Maximal Matching Algorithm , 2010, IEICE Trans. Inf. Syst..
[8] Hamamache Kheddouci,et al. A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs , 2010, J. Parallel Distributed Comput..
[9] Edsger W. Dijkstra,et al. Self-stabilizing systems in spite of distributed control , 1974, CACM.
[10] Shing-Tsaan Huang,et al. A Self-Stabilizing Algorithm for Maximal Matching , 1992, Inf. Process. Lett..
[11] Jean R. S. Blair,et al. Efficient self-stabilizing algorithms for tree networks , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..