Sparse cut projections in graph streams

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

Volumn 5757 LNCS, Issue , 2009, Pages 480-491

  Das Sarma, Atish ^a   Gollapudi, Sreenivas ^b   Panigrahy, Rina ^b  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH PARTITION; GRAPH PROPERTIES; INPUT GRAPHS; LARGE GRAPHS; MAIN MEMORY; REGULAR GRAPHS; RELEVANT DOCUMENTS; SOCIAL COMMUNITIES; STREAMING MODEL; SUBLINEAR; WEB GRAPHS;

SEARCH ENGINES; VLSI CIRCUITS;

GRAPH THEORY;

EID: 70350393273     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04128-0_43     Document Type: Conference Paper

References (22)

1. Ahn, K.J., Guha, S.: Graph sparsification in the semi-streaming model. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. Part II. LNCS, vol. 5556, pp. 328-338. Springer, Heidelberg (2009)
2. Alon, N.: Eigenvalues and expanders. Combinatorica 6(2), 83-96 (1986) Sparse Cut Projections in Graph Streams 491
3. Andersen, R., Chung, F.R.K., Lang, K.J.: Local Graph Partitioning using PageRank Vectors. In: FOCS, pp. 475-486 (2006)
4. Arora, S., Rao, S., Vazirani, U.V.: Expander flows, geometric embeddings and graph partitioning. In: STOC, pp. 222-231 (2004)
5. 2) Time. In: STOC, pp. 47-55 (1996)
6. Bhatt, S.N., Leighton, F.T.: A Framework for Solving VLSI Graph Layout Problems. J. Comput. Syst. Sci. 28(2), 300-343 (1984)
7. Boppana, R.: Eigenvalues and graph bisection: an average case analysis. In: 28th IEEE Symposium on Foundations of Computer Science, FOCS (1987)
8. Borgs, C., Chayes, J.T., Mahdian, M., Saberi, A.: Exploring the community structure of newsgroups. In: KDD, pp. 783-787 (2004)
9. Sarma, A.D., Gollapudi, S., Panigrahy, R.: Estimating PageRank on graph streams. In: PODS, pp. 69-78 (2008)
10. Demetrescu, C., Finocchi, I., Ribichini, A.: Trading of space for passes in graph streaming problems. In: ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 714-723 (2006)
11. Goldreich, O., Ron, D.: Property Testing in Bounded Degree Graphs. In: STOC, pp. 406-415 (1997)
12. Henzinger, M., Raghavan, P., Rajagopalan, S.: Computing on data streams. In: External Memory Algorithms. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 50, pp. 107-118 (1999)
13. Karger, D.R.: Minimum cuts in near-linear time. J. ACM 47(1), 46-76 (2000)
14. Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. In: SODA, pp. 668-677 (1998)
15. Lempel, R., Moran, S.: Salsa: the stochastic approach for link-structure analysis. ACMTrans. Inf. Syst. 19(2), 131-160 (2001)
16. Leskovec, J., Dumais, S., Horvitz, E.: Web projections: learning from contextual subgraphs of the web. In:WWW2007: Proceedings of the 16th international conference onWorldWide Web, pp. 471-480. ACM, New York (2007)
17. Leskovec, J., Faloutsos, C.: Sampling from large graphs. In: KDD, pp. 631-636 (2006)
18. Lovász, L., Simonovits,M.: TheMixing Rate ofMarkov Chains, an Isoperimetric Inequality, and Computing the Volume. In: FOCS, pp. 346-354 (1990)
19. Lovász, L., Simonovits, M.: Random Walks in a Convex Body and an Improved Volume Algorithm. Random Struct. Algorithms 4(4), 359-412 (1993)
20. Manokaran, R., Naor, J., Raghavendra, P., Schwartz, R.: SDP gaps and UGC hardness for multiway cut, 0-extension, and metric labeling. In: STOC, pp. 11-20 (2008)
21. Sinclair, A., Jerrum, M.: Conductance and the mixing property of markov chains; the approximation of the permanent resolved. In: Proc. of the 20th annual ACM Symposium on Theory of computing, pp. 235-244 (1988)
22. Spielman, D.A., Teng, S.-H.: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In: STOC, pp. 81-90 (2004)