Author:
Inoue Michiko,Ooshita Fukuhito,Tixeuil Sébastien
Publisher
Springer International Publishing
Reference20 articles.
1. Asada, Y., Ooshita, F., Inoue, M.: An efficient silent self-stabilizing 1-maximal matching algorithm in anonymous networks. J. Graph Algorithms Appl. 20(1), 59–78 (2016). doi:
10.7155/jgaa.00384
2. Blair, J.R.S., Hedetniemi, S.M., Hedetniemi, S.T., Jacobs, D.P.: Self-stabilizing maximum matchings. Congr. Numer. 153, 151–160 (2001)
3. Blair, J.R.S., Manne, F.: Efficient self-stabilizing algorithms for tree networks. In: Proceedings of 23rd International Conference on Distributed Computing Systems, pp. 20–26. IEEE (2003)
4. Chattopadhyay, S., Higham, L., Seyffarth, K.: Dynamic and self-stabilizing distributed matching. In: Proceedings of the Twenty-First Annual Symposium on Principles of Distributed Computing, pp. 290–297. ACM (2002)
5. Cohen, J., Maâmra, K., Manoussakis, G., Pilard, L.: Polynomial self-stabilizing maximal matching algorithm with approximation ratio 2/3. In: International Conference on Principles of Distributed Systems (2016)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献