On finding common neighborhoods in massive graphs

Theoretical Computer Science

Volumn 299, Issue 1-3, 2003, Pages 707-718

  Buchsbaum, Adam L ^a   Giancarlo, Raffaele ^b   Westbrook, Jeffery R ^c  

^a AT AND T LABS RESEARCH   (United States)

^b UNIVERSITY OF PALERMO   (Italy)

^c NONE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; RANDOM PROCESSES;

MASSIVE GRAPHS;

GRAPH THEORY;

EID: 0037453355     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00569-8     Document Type: Article

References (27)

1. Alon N., Matias Y., Szegedy M. The space complexity of approximating the frequency moments. J. Comput. System Sci. 58(1):1999;137-147.
2. Ballobás B. Extremal Graph Theory. 1978;Academic Press, New York.
3. Ballobás B. Extremal graph theory. Graham R.L., Grötschel M., Lovász L. Handbook of Combinatorics. Vol. II:1995;1231-1292 The MIT Press-North Holland, Cambridge, MA, Amsterdam.
4. A.Z. Broder, S.C. Glassman, M.S. Manasse, G. Zweig, Syntactic clustering of the Web, Comput. Networks 29 (8-13) (1997) 1157-66. Proc. Sixth Internat. World Wide Web Conf.
5. Chan P., Fan W., Prodromidis A., Stolfo S. Distributed data mining in credit card fraud detection. IEEE Intell. Systems. 14(6):1999;67-74.
6. C. Cortes, K. Fisher, D. Pregibon, A. Rogers, Hancock: a language for extracting signatures from data streams, in: Proc. Sixth ACM SIGKDD Internat. Conf. on Knowledge Discovery and Data Mining 2000, pp. 9-17.
7. M. Fang, N. Shivakumar, H. Garcia-Molina, R. Motwani, J.D. Ullman, Computing iceberg queries efficiently, in: Proc. 24th Internat. Conf. on Very Large Databases, 1998, pp. 299-310.
8. 1 -difference algorithm for massive data streams, in: Proc. 40th IEEE Symp. on Foundations of Computer Science, 1999, pp. 501-511.
9. J. Feigenbaum, S. Kannan, M. Strauss, M. Viswanathan, Testing and spot-checking of data streams, in: Proc. 11th ACM-SIAM Symp. on Discrete Algorithms, 2000, pp. 165-174.
10. Flajolet P., Martin G.N. Probabilistic counting algorithms for data base applications. J. Comput. System Sci. 31:1985;182-209.
11. Füredy Z. New asymptotics for bipartite Turán numbers. J. Combin. Theory A. 75(1):1996;141-144.
12. Ganti V., Gehrke J., Ramakrishnan R. Mining very large databases. IEEE Comput. 32(8):1999;38-45.
13. M.R. Henzinger, P. Raghavan, S. Rajagopalan, Computing on data streams, Technical Report 1998-011, DEC SRC, 1998.
14. A. Hume, S. Daniels, A. MacLellen, Gecko: tracking a very large billing system, in: Proc. USENIX Ann. Technical Conf., 1999.
15. P. Indyk, Stable distributions, pseudorandom generators, embeddings and data stream computation, in: Proc. 41st IEEE Symp. on Foundations of Computer Science, 2000.
16. Kleinberg J. Authoritative sources in a hyperlinked environment. J. ACM. 46(5):1999;604-632.
17. Li C.-S., Ramaswami R. Automatic fault detection, isolation, and recovery in transparent all-optical networks. J. Lightwave Technol. 15(10):1997;1784-1793.
18. G.S. Manki, S. Rajagopalan, B.G. Lindsay, Approximate medians and other quantiles in one pass with limited memory, in: Proc. 1998 ACM SIGMOD Internat. Conf. on Management of Data, 1998, pp. 426-435.
19. G.S. Manku, S. Rajagopalan, B. Lindsay, Random sampling techniques for space efficient online computation of order statistics of large databases, in: Proc. 1999 ACM SIGMOD Internat. Conf. on Management of Data, 1999, pp. 251-262.
20. Motwani R., Raghavan P. Randomized Algorithms. 1995;Cambridge University Press, Cambridge, UK.
21. Munro J.I., Paterson M.S. Selection and sorting with limited storage. Theoret. Comput. Sci. 12:1980;315-323.
22. Nisan N., Kushilevitz E. Communication Complexity. 1997;Cambridge University Press, Cambridge, UK.
23. S. Stolfo, W. Fan, W. Lee, A. Prodromidis, P. Chan, Cost-based modeling for fraud and intrusion detection: results from the JAM project, in: Proc. DARPA Information and Survivability Conf. and Exposition, Vol. 2, 2000, pp. 130-144.
24. S.G. Tzafestas, P.J. Dalianis, Fault diagnosis in complex systems using artificial neural networks, in: Proc. Third IEEE Conf. on Control Applications, Vol. 2, 1994, pp. 877-882.
25. J.D. Ullman, The MIDAS data-mining project at stanford, in: Proc. 1999 IEEE Symp. on Database Engineering and Applications, 1999, pp. 460-464.
26. Vitter J.S. External memory algorithms and data structures. dealing with massive data ACM Comput. Surveys. 33(2):2001;209-271.
27. Zarankiewicz K. Problem P 101. Colloq. Math. 2:1951;301.