Author:
Inoue Michiko,Ooshita Fukuhito,Tixeuil Sébastien
Publisher
Springer International Publishing
Reference18 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). http://dx.doi.org/10.7155/jgaa.00384
2. Blair, J.R., Manne, F.: Efficient self-stabilizing algorithms for tree networks. In: Proceedings of 23rd International Conference on Distributed Computing Systems, pp. 20–26. IEEE (2003)
3. Blair, J., Hedetniemi, S., Hedetniemi, S., Jacobs, D.: Self-stabilizing maximum matchings. Congressus Numerantium 153, 151–160 (2001)
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. Datta, A.K., Larmoreand, L.L., Masuzawa, T.: Maximum matching for anonymous trees with constant space per process. In: Proceedings of International Conference on Principles of Distributed Systems. pp. 1–16 (2015)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献