Publisher
Springer International Publishing
Reference31 articles.
1. Ahn, K.J., Guha, S.: Linear programming in the semi-streaming model with application to the maximum matching problem. Inf. Comput. 222, 59–79 (2013). Conference version at ICALP 2011
2. Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58, 137–147 (1999). Conference version at STOC 1996
3. Alt, H., Blum, N., Mehlhorn, K., Paul, M.: Computing a maximum cardinality matching in a bipartite graph in time $$O(n^{1.5}\sqrt{m/\log n})$$ . Inf. Process. Lett. 37, 237–240 (1991)
4. Assadi, S., Khanna, S., Li, Y., Yaroslavtsev, G.: Tight bounds for linear sketches of approximate matchings (2015). http://arxiv.org/abs/1505.01467
5. Berge, C.: Two theorems in graph theory. Proc. Natl. Acad. Sci. United States Am. 43(9), 842–844 (1957). http://www.pnas.org/content/43/9/842.short
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献