Algorithms for Streaming Graphs

[1]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[2]  Raffaele Giancarlo,et al.  On finding common neighborhoods in massive graphs , 2003, Theor. Comput. Sci..

[3]  Mariano Zelke,et al.  k-Connectivity in the Semi-Streaming Model , 2006, ArXiv.

[4]  Corinna Cortes,et al.  Communities of interest , 2001, Intell. Data Anal..

[5]  Joan Feigenbaum,et al.  On graph problems in a semi-streaming model , 2005, Theor. Comput. Sci..

[6]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

[7]  Zsolt Tuza,et al.  Maximum cuts and largest bipartite subgraphs , 1993, Combinatorial Optimization.

[8]  D. R. Fulkerson,et al.  Maximal Flow Through a Network , 1956 .

[9]  Ziv Bar-Yossef,et al.  Reductions in streaming algorithms, with an application to counting triangles in graphs , 2002, SODA '02.

[10]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[11]  S. Ross.  A random graph , 1981 .

[12]  Michael Elkin.  Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining Sparse Spanners , 2007, ICALP.

[13]  Ralf Diekmann,et al.  Quality matching and local improvement for multilevel graph-partitioning , 2000, Parallel Comput..

[14]  Toshihide Ibaraki,et al.  A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph , 1992, Algorithmica.

[15]  Robert Preis,et al.  Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs , 1999, STACS.

[16]  Peter Sanders,et al.  A simpler linear time 2/3-epsilon approximation for maximum weight matching , 2004, Inf. Process. Lett..

[17]  Jennifer Widom,et al.  Models and issues in data stream systems , 2002, PODS.

[18]  Bernard Chazelle,et al.  A minimum spanning tree algorithm with inverse-Ackermann type complexity , 2000, JACM.

[19]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[20]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[21]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[22]  Svante Janson,et al.  Random graphs , 2000, ZOR Methods Model. Oper. Res..

[23]  Jeffrey Scott Vitter,et al.  Random sampling with a reservoir , 1985, TOMS.

[24]  Joan Feigenbaum,et al.  Graph distances in the streaming model: the value of space , 2005, SODA '05.

[25]  Camil Demetrescu,et al.  Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems , 2007, MFCS.

[26]  David Eppstein,et al.  Sparsification—a technique for speeding up dynamic graph algorithms , 1997, JACM.

[27]  Prabhakar Raghavan,et al.  Computing on data streams , 1999, External Memory Algorithms.

[28]  Sumit Ganguly,et al.  On Estimating Path Aggregates over Streaming Graphs , 2006, ISAAC.

[29]  Divesh Srivastava,et al.  Space- and time-efficient deterministic algorithms for biased quantiles over data streams , 2006, PODS.

[30]  Eyal Kushilevitz,et al.  Communication Complexity , 1997, Adv. Comput..

[31]  Harold N. Gabow,et al.  Data structures for weighted matching and nearest common ancestors with linking , 1990, SODA '90.

[32]  Rolf H. Möhring,et al.  Complexity and Modeling Aspects of Mesh Refinement into Quadrilaterals , 1997, ISAAC.

[33]  Surender Baswana,et al.  Streaming algorithm for graph spanners - single pass and constant processing time per edge , 2008, Inf. Process. Lett..

[34]  J. Ian Munro,et al.  Selection and sorting with limited storage , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[35]  David R. Karger,et al.  Using randomized sparsification to approximate minimum cuts , 1994, SODA '94.

[36]  A. Barabasi,et al.  Scale-free characteristics of random networks: the topology of the world-wide web , 2000 .

[37]  Andrew McGregor,et al.  Finding Graph Matchings in Data Streams , 2005, APPROX-RANDOM.

[38]  Harold N. Gabow.  A matroid approach to finding edge connectivity and packing arborescences , 1991, STOC '91.

[39]  S. Muthukrishnan,et al.  Data streams: algorithms and applications , 2005, SODA '03.

[40]  Seth Pettie,et al.  An optimal minimum spanning tree algorithm , 2000, JACM.

[41]  Gerhard J. Woeginger,et al.  Space and Time Complexity of Exact Algorithms: Some Open Problems (Invited Talk) , 2004, IWPEC.

[42]  Christian Sohler,et al.  Counting triangles in data streams , 2006, PODS.

[43]  Ravi Kumar,et al.  Trawling the Web for Emerging Cyber-Communities , 1999, Comput. Networks.

[44]  Camil Demetrescu,et al.  Trading off space for passes in graph streaming problems , 2006, SODA 2006.

[45]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[46]  Martin Grötschel,et al.  An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design , 1988, Oper. Res..

[47]  H. Chernoff.  A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[48]  Mariano Zelke.  Weighted Matching in the Semi-Streaming Model , 2008, STACS.

[49]  Harold N. Gabow.  Using expander graphs to find vertex connectivity , 2006, JACM.

[50]  Matthias Ruhl,et al.  Efficient algorithms for new computational models , 2003 .

[51]  Sudipto Guha,et al.  Fast, small-space algorithms for approximate histogram maintenance , 2002, STOC '02.

[52]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[53]  Ryan O'Donnell,et al.  Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs? , 2007, SIAM J. Comput..

[54]  Rodrigo A. Botafogo.  Cluster analysis for hypertext systems , 1993, SIGIR.

[55]  Stefan Hougardy,et al.  A linear-time approximation algorithm for weighted matchings in graphs , 2005, TALG.

[56]  Piotr Indyk,et al.  Stable distributions, pseudorandom generators, embeddings, and data stream computation , 2006, JACM.

[57]  Divyakant Agrawal,et al.  An integrated efficient solution for computing frequent and top-k elements in data streams , 2006, TODS.

[58]  Mohammad Ghodsi,et al.  New Streaming Algorithms for Counting Triangles in Graphs , 2005, COCOON.