Counting arbitrary subgraphs in data streams

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7392 LNCS, Issue PART 2, 2012, Pages 598-609

  Kane, Daniel M ^a   Mehlhorn, Kurt ^b   Sauerwald, Thomas ^b   Sun, He ^b,c  

^a STANFORD UNIVERSITY   (United States)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^c FUDAN UNIVERSITY   (China)

Author keywords

data streams; network analysis; subgraph counting

Indexed keywords

AUTOMATA THEORY; ELECTRIC NETWORK ANALYSIS; ROBOTS;

CONSTANT SIZES; COUNTING PROBLEMS; NON-REGULAR GRAPH; NON-TRIVIAL; POWER LAW GRAPHS; SUBGRAPHS;

DATA STREAMS;

EID: 84884175563     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31585-5_53     Document Type: Conference Paper

References (17)

1. Alon, N., Spencer, J.: The Probabilistic Method, 3rd edn.Wiley- Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons (2008)
2. Alon, N., Yuster, R., Zwick, U.: Finding and counting given length cycles. Algorithmica 17(3), 209-223 (1997)
3. Bar-Yossef, Z., Kumar, R., Sivakumar, D.: Reductions in streaming algorithms, with an application to counting triangles in graphs. In: Proc. 13th Symp. on Discrete Algorithms (SODA), pp. 623-632 (2002)
4. Becchetti, L., Boldi, P., Castillo, C., Gionis, A.: Efficient semi-streaming algorithms for local triangle counting in massive graphs. In: Proc. 14th Intl. Conf. Knowledge Discovery and Data Mining (KDD), pp. 16-24 (2008)
5. Bordino, I., Donato, D., Gionis, A., Leonardi, S.: Mining large networks with subgraph counting. In: Proc. 8th Intl. Conf. on Data Mining (ICDM), pp. 737-742 (2008)
6. Buriol, L.S., Frahling, G., Leonardi, S., Marchetti-Spaccamela, A., Sohler, C.: Counting triangles in data streams. In: Proc. 25th Symp. Principles of Database Systems (PODS), pp. 253-262 (2006)
7. Buriol, L.S., Frahling, G., Leonardi, S., Sohler, C.: Estimating Clustering Indexes in Data Streams. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 618-632. Springer, Heidelberg (2007)
8. Ganguly, S.: Estimating Frequency Moments of Data Streams Using Random Linear Combinations. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol. 3122, pp. 369-380. Springer, Heidelberg (2004)
9. Gonen, M., Ron, D., Shavitt, Y.: Counting stars and other small subgraphs in sublinear-time. SIAM J. Disc. Math. 25(3), 1365-1411 (2011)
10. Jowhari, H., Ghodsi, M.: New Streaming Algorithms for Counting Triangles in Graphs. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 710-716. Springer, Heidelberg (2005)
11. Manjunath, M., Mehlhorn, K., Panagiotou, K., Sun, H.: Approximate Counting of Cycles in Streams. In: Demetrescu, C., Halld́orsson, M.M. (eds.) ESA 2011. LNCS, vol. 6942, pp. 677-688. Springer, Heidelberg (2011)
12. McGregor, A.: Open Problems in Data Streams and Related Topics, IITK Workshop on Algorithms For Data Sreams (2006), http://www.cse.iitk.ac.in/users/ sganguly/data-stream-probs.pdf
13. Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network motifs: Simple building blocks of complex networks. Science 298(5594), 824-827 (2002)
14. Muthukrishnan, S.: Data Streams: Algorithms and Applications. Foundations and Trends in Theoretical Computer Science 1(2) (2005)
15. Newman, M.E.J.: The structure and function of complex networks. SIAM Review 45, 167-256 (2003)
16. Pagh, R., Tsourakakis, C.E.: Colorful triangle counting and a mapreduce implementation. Inf. Process. Lett. 112(7), 277-281 (2012)
17. Wong, E., Baur, B., Quader, S., Huang, C.: Biological network motif detection: principles and practice. Briefings in Bioinformatics, 1-14 (June 2011)