Maintaining bridge-connected and biconnected components on-line
- 512 Downloads
We consider the twin problems of maintaining the bridge-connected components and the biconnected components of a dynamic undirected graph. The allowed changes to the graph are vertex and edge insertions. We give an algorithm for each problem. With simple data structures, each algorithm runs inO(n logn +m) time, wheren is the number of vertices andm is the number of operations. We develop a modified version of the dynamic trees of Sleator and Tarjan that is suitable for efficient recursive algorithms, and use it to reduce the running time of the algorithms for both problems toO(mα(m,n)), where α is a functional inverse of Ackermann's function. This time bound is optimal. All of the algorithms useO(n) space.
Key wordsOn-line algorithms Graph algorithms Graph connectivity Dynamic trees Data structures
Unable to display preview. Download preview PDF.
- G. D. Battista and R. Tamassia. Incremental planarity testing.Proc. 30th IEEE Symposium on Foundations of Computer Science, pages 436–441, 1989.Google Scholar
- G. D. Battista and R. Tamassia. On-line graph algorithms with spqr-trees.Proc. 17th Internat. Conf. on Automata, Languages, and Programming (ICALP 1990). Lecture Notes in Computer Science, vol. 443, pages 598–611. Springer-Verlag, Berlin, 1990.Google Scholar
- G. A. Cheston. Incremental Algorithms in Graph Theory. Ph.D. thesis, Dept. of Computer Science, University of Toronto, 1976. Technical Report No. 91.Google Scholar
- M. L. Fredman and M. E. Saks. The cell probe complexity of dynamic data structures.Proc. 21st ACM Symposium on Theory of Computing, pages 345–354, Seattle, WA, May 1989.Google Scholar
- R. Karp and V. Ramachandran. Parallel Algorithms for Shared Memory Machines.Handbook of Theoretical Computer Science, Elsevier, Amsterdam, 1990, pages 869–942.Google Scholar
- J. A. La Poutré. Lower bounds for the union-find and split-find problem on pointer machines.Proc. 22nd ACM Symposium on Theory of Computing, pages 34–44, 1990.Google Scholar
- J. A. La Poutré, J. van Leeuwen, and M. H. Overmars. Maintenance of 2- and 3-Connected Components of Graphs, Part I: 2- and 3-Edge-Connected Components. Technical Report RUU-CS-90-26, Utrecht University, 1990.Google Scholar
- R. Tamassia. A dynamic data structure for planar graph embedding.Proc. 15th Internat. Conf. on Automata, Languages, and Programming (ICALP1988). Lecture Notes in Computer Science, vol. 317, pages 576–590. Springer-Verlag, Berlin, 1988.Google Scholar
- R. Tamassia. Dynamic Data Structures for Two-Dimensional Searching. Ph.D. thesis, Coordinated Science Laboratory, University of Illinois at Urbana-Champagne, 1988. Technical Report ACT-100.Google Scholar
- R. E. Tarjan.Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.Google Scholar
- J. Westbrook and R. E. Tarjan. Maintaining Bridge-Connected and Biconnected Components On-Line. Technical Report CS-TR-228-89, Dept. of Computer Science, Princeton University, Princeton, NJ, 1989.Google Scholar