Author:
Feigenbaum Joan,Kannan Sampath,McGregor Andrew,Suri Siddharth,Zhang Jian
Subject
General Computer Science,Theoretical Computer Science
Reference21 articles.
1. A functional approach to external graph algorithms;Abello;Algorithmica,2002
2. The space complexity of approximating the frequency moments;Alon;J. Comput. Systems Sci.,1999
3. I. Althöfer, G. Das, D. Dobkin, D. Joseph, Generating sparse spanners for weighted graphs, in: Proc. 2nd Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science, Vol. 447, Springer, Berlin, 1990, pp. 26–37.
4. Z. Bar-Yossef, R. Kumar, D. Sivakumar, Reductions in streaming algorithms, with an application to counting triangles in graphs, in: Proc. 13th ACM–SIAM Symp. on Discrete Algorithms, 2002, pp. 623–632.
5. Extremal Graph Theory;Bollobás,1978
Cited by
165 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献