
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Weifa Liang, Richard P. Brent, Hong Shen, "Fully Dynamic Maintenance of kConnectivity in Parallel," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 8, pp. 846864, August, 2001.  
BibTex  x  
@article{ 10.1109/71.946661, author = {Weifa Liang and Richard P. Brent and Hong Shen}, title = {Fully Dynamic Maintenance of kConnectivity in Parallel}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {12}, number = {8}, issn = {10459219}, year = {2001}, pages = {846864}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.946661}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Fully Dynamic Maintenance of kConnectivity in Parallel IS  8 SN  10459219 SP846 EP864 EPD  846864 A1  Weifa Liang, A1  Richard P. Brent, A1  Hong Shen, PY  2001 KW  NC algorithms KW  2edge/vertex connectivity KW  3edge/vertex connectivity KW  dynamic data structures KW  parallel algorithm design and analysis KW  graph problems. VL  12 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—Given a graph
[1] A.V. Aho,J.E. Hopcroft, and J.D. Ullman,The Design and Analysis of Computer Algorithms.Reading, Mass.: AddisonWesley, 1974.
[2] B. Awerbuch and Y. Shiloach, “New Connectivity and MSF Algorithms for ShuffleExchange Networks and PRAM,” IEEE Trans. Computers, vol. 36, pp. 12581263, 1987.
[3] R.P. Brent, "The Parallel Evaluation of General Arithmetic Expressions," J. ACM, vol. 21, pp. 201206, 1974.
[4] J. Cheriyan, M.Y. Kao, and R. Thurimella, “ScanFirst Search and Sparse Certificatesan Improved Parallel Algorithm forkVertex Connectivity,” SIAM J. Computers, vol. 22, pp. 157174, 1993.
[5] F.Y. Chin, J. Lam, and I. Chen, "Efficient Parallel Algorithms for Some Graph Problems," Comm. ACM, vol. 25, no. 9, pp. 659665, 1982.
[6] R. Cole and U. Vishkin, “Approximate and Exact Parallel Scheduling with Applications to List, Tree, and Graph Problems,” Proc. 27th Ann. Symp. Foundations of Computer Science, pp. 478491, 1986.
[7] D. Coppersmith and S. Winograd,"Matrix multiplication via arithmetic progressions," Proc. 19th Ann. Symp. Theory of Computing, pp. 16, 1987.
[8] S.K. Das and P. Ferragina, “An$o(n)$Work EREW Parallel Algorithm for Updating MST,” Proc. European Symp. Algorithms, pp. 331342, 1994.
[9] E.A. Dinitz, “Maintaining the 4EdgeConnected Components of a Graph OnLine,” Proc. Second Israel Symp. Theory of Computing and Systems, pp. 8899, 1993.
[10] D. Eppstein, Z. Galil, G.F. Italiano, and A. Nissenzweig, “Sparsification—A Technique for Speeding Up Dynamic Graph Algorithms,” J. ACM, vol. 44, pp. 669696, 1997.
[11] D. Eppstein, Z. Galil, and G.F. Italiano, “Improved Sparsification,” Technical Report, TR9320, Dept. of Information and Computer Science, Univ. of California, Irvine, 1993.
[12] S. Even and Y. Shiloach, “An OnLine Edge Deletion Problem,” J. ACM, vol. 28, pp. 14, 1981.
[13] P. Ferragina, “Static and Dynamic Parallel Computation of Connected Components,” Information Processing Letters, vol. 50, pp. 6368, 1994.
[14] P. Ferragina, “An EREW PRAM FullyDynamic Algorithm for MST,” Proc. Ninth Int'l Conf. Parallel Processing Symp., pp. 93100, 1995.
[15] G.N. Frederickson, “Data Structures for OnLine Updating of Minimum Spanning Trees,” SIAM J. Computing, vol. 14, pp. 781798, 1985.
[16] G.N. Frederickson, “Ambivalent Data Structures for Dynamic 2EdgeConnectivity andkSmallest Spanning Trees,” Proc. 32nd Ann. Symp. Foundations of Computer Science, pp. 632641, 1991.
[17] D. Fussel, V. Ramachandran, and R. Thurimella, “Finding Triconnected Components by Local Replacement,” SIAM J. Computing, vol. 22, pp. 587615, 1993.
[18] Z. Galil and G.F. Italiano, “Reducing Edge Connectivity to Vertex Connectivity,” SIGACT News, vol. 22, pp. 5761, 1991.
[19] Z. Galil and G.F. Italiano, “Fully Dynamic Algorithms for 2EdgeConnectivity, Fully Dynamic Algorithms for 2EdgeConnectivity,” SIAM J. Computing, vol. 21, pp. 10471069, 1992.
[20] Z. Galil and G.F. Italiano, “Fully Dynamic Algorithms for 2EdgeConnectivity, Maintaining the 3EdgeConnected Components of a Graph OnLine,” SIAM J. Computing, vol. 22, pp. 1128, 1993.
[21] Z. Galil and G.F. Italiano, “Fully Dynamic Algorithms for 2EdgeConnectivity, Fully Dynamic Algorithms for 3EdgeConnectivity,” Manuscript, 1992.
[22] F. Harary, Graph Theory. Reading, Mass.: AddisonWesley, 1969.
[23] M.R. Henzinger and V. King, “Fully Dynamic Algorithms for 2EdgeConnectivity, Full Dynamic Biconnectivity and Transitive Closure,” Proc. 36th Symp. Foundations of Computer Science, pp. 664672, 1995.
[24] M.R. Henzinger and V. King, “Fully Dynamic Algorithms for 2EdgeConnectivity, Randomized Dynamic Graph Algorithms with Polylogarithmic Time per Operation,” Proc. 27th Symp. Theory of Computing, pp. 519527, 1995.
[25] M.R. Henzinger and V. King, “Fully Dynamic Algorithms for 2EdgeConnectivity, Maintaining Minimum Spanning Trees in Dynamic Graphs,” Proc. 24th Int'l Colloquium on Automata, Languages, and Programming, pp. 594604, 1997.
[26] M.R. Henzinger and H. La Poutré, “Certificates and Fast Algorithms for Biconnectivity in FullyDynamic Graphs,” Proc. Third European Symp. Algorithms, pp. 171184, 1995.
[27] M.R. Henzinger and M. Thorup, “Sampling to Provide or to Bound: With Applications to Fully Dynamic Graph Algorithms,” Random Structures and Algorithms, vol. 11, pp. 369379, 1997.
[28] J. Holm, K. de Lichtenberg, and M. Thorup, “PolyLogarithmic Deterministic FullyDynamic Algorithms for Connectivity, Minimum Spanning Tree, 2Edge, and Biconnectivity,” Proc. 30th Symp. Theory of Computing, pp. 7989, 1998.
[29] K. Iwama, C. Iwamoto, and T. Ohsawa, “A Faster Parallel Algorithm forkConnectivity,” Information Processing Letters, vol. 61, pp. 265269, 1997.
[30] A. Kanevsky, R. Tamassia, G. Di Battista, and J. Chen, “OnLine Maintenance of the FourConnected Components of a Graph,” Proc. 32nd Ann. Symp. Foundations of Computer Science, pp. 793801, 1991.
[31] R.M. Karp and V. Ramachandran, "Parallel Algorithms for SharedMemory Machines," Handbook of Theoretical Computer Science, J. van Leeuwen, ed., vol. A, pp. 869941.Amsterdam: NorthHolland, 1990.
[32] S. Khuller and B. Schieber, "Efficient Parallel Algorithms for Testing kConnectivity and Finding Disjoint st Paths in Graphs," SIAM J. Computers, vol. 20, pp. 352375, 1991.
[33] J.A. La Poutré, “Maintenance of Triconnected Components of Graphs,” Proc. 19th Int'l Colloquium Automata, Languages and Programming, LNCS 623, pp. 354365, 1992.
[34] J.A. La Poutré, J. van Leeuwen, and M.H. Overmars, “Maintenance of 2 and 3Connected Components of Graphs, Part I: 2 and 3EdgeConnected Components,” Discrete Math., vol. 114, pp. 329359, 1993.
[35] W. Liang and B.D. McKay, “Fully Dynamic Maintenance of Minimum Spanning Trees by Using a Sublinear Number of Processors,” Manuscript, http://www.netlib.org/utk/papers/mpibook/ mpibook.pshttp://cs.anu.edu.au/~Weifa.Liang Unpublished_manuscripts, Dec. 1994.
[36] W. Liang and H. Shen, “Fully Dynamic Maintaining 2Edge Connectivity in Parallel,” Proc. Seventh Symp. Parallel and Distributed Processing, pp. 216223, 1995.
[37] R.J. Lipton and R.E. Tarjan, “A Separator Theorem for Planar Graphs,” SIAM J. Applied Math., vol. 3, pp. 177189, 1979.
[38] H. Nagamochi and T. Ibaraki, “A Linear Time Algorithm for Finding a SparsekConnected Subgraph of akConnected Graph,” Algorithmica, vol. 7, pp. 583596, 1992.
[39] H. Nagamochi and T. Ibaraki, “Computing EdgeConnectivity in Multigraphs and Capacitated Graphs,” SIAM J. Discrete Math., vol. 5, pp. 5466, 1992.
[40] M. Rauch, “Fully Dynamic Biconnectivity in Graphs,” Proc. 33rd Symp. Foundations of Computer Science, pp. 5059, 1992.
[41] M. Rauch, “Improved Data Structures for Fully Dynamic Biconnectivity,” Proc. 26th Symp. Theory of Computing, pp. 686695, 1994.
[42] B. Schieber and U. Vishkin, "On Finding Lowest Common Ancestors: Simplification and Parallelization," SIAM J. Computing, vol. 17, pp. 1,2531,262, 1988.
[43] Y. Shiloach and U. Vishkin, “An$O(\log n)$Parallel Connectivity Algorithm,” J. Algorithms, vol. 3, pp. 5767, 1982.
[44] R.E. Tarjan and U. Vishkin, “An Efficient Parallel Biconnectivity Algorithm,” SIAM J. Computing, vol. 14, pp. 862864, 1985.
[45] J. Westbrook and R.E. Tarjan, “Maintaining BridgeConnected and Biconnected Components OnLine,” Algorithmica, vol. 7, pp. 433464, 1992.