Author:
Mishra Abhishek,Gunturi Venkata M. V.,Ramnath Sarnath
Publisher
Springer International Publishing
Reference19 articles.
1. Azad, A., Buluç, A.: Distributed-memory algorithms for maximum cardinality matching in bipartite graphs. In: Proceedings of the IPDPS, pp. 32–42 (2016)
2. Bortnikov, E., et al.: The load-distance balancing problem. Networks 59(1), 22–29 (2012)
3. Cormen, T.H., Stein, C., Rivest, R.L., Leiserson, C.E.: Introduction to Algorithms, 2nd edn. McGraw-Hill Higher Education, New York (2001)
4. Lecture Notes in Computer Science;M Deveci,2013
5. Fenner, S., Gurjar, R., Thierauf, T.: A deterministic parallel algorithm for bipartite perfect matching. Commun. ACM 62(3), 109–115 (2019)