Optimal per-edge processing times in the semi-streaming model

Information Processing Letters

Volumn 104, Issue 3, 2007, Pages 106-112

  Zelke, Mariano ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

Graph algorithms; Per edge processing time; Streaming algorithms

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; PROBLEM SOLVING; RANDOM PROCESSES;

GRAPH ALGORITHMS; PER-EDGE PROCESSING TIME; STREAMING ALGORITHMS;

GRAPH THEORY;

EID: 34547652400     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2007.06.004     Document Type: Article

References (13)

1. Bollobás B. Graph Theory, An Introductory Course (1979), Springer, New York
2. Chazelle B. A minimum spanning tree algorithm with inverse-Ackermann type complexity. J. ACM 47 6 (2000) 1028-1047
3. Eppstein D., Galil Z., Italiano G.F., and Nissenzweig A. Sparsification-A technique for speeding up dynamic graph algorithms. J. ACM 44 1 (1997) 669-696
4. Feigenbaum J., Kannan S., McGregor A., Suri S., and Zhang J. On graph problems in a semi-streaming model. ICALP 2004. LNCS vol. 3142 (2004), Springer, Berlin 531-543
5. J. Feigenbaum, S. Kannan, A. McGregor, S. Suri, J. Zhang, Graph distances in the streaming model: The value of space, in: SODA 2005, pp. 745-754
6. Gabow H.N. A matroid approach to finding edge connectivity and packing arborescences. J. Comput. System Sci. 50 2 (1995) 259-273
7. Gabow H.N. Using expander graphs to find vertex connectivity. Proceedings of the 41st IEEE Symposium on Foundations of Computer Science (2000), IEEE Computer Society, Los Alamitos, CA 410-420
8. Muthukrishnan S. Data streams: Algorithms and applications. 2003. Available at. http://athos.rutgers.edu/~muthu/stream-1-1.ps
9. Nagamochi N., and Ibaraki T. A linear time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica 7 (1992) 583-596
10. S. Pettie, Finding minimum spanning trees in O (m α (m, n)) time, Tech. Rep. TR99-23, Univ. of Texas at Austin, Austin, TX
11. Pettie S., and Ramachandran V. An optimal minimum spanning tree algorithm. J. ACM 49 1 (2002) 16-34
12. R.E. Tarjan, Data structures and network algorithms, CBMS-NSF Regional Conference Series in Applied Mathematics, 1983
13. M. Zelke, k-connectivity in the semi-streaming model, 2006. Available at cs.DM/0608066