Incremental maintenance of the 5-edge-connectivity classes of a graph

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

Volumn 1851, Issue , 2000, Pages 272-285

  Dinitz, Yefim ^a   Nossenson, Ronit ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; EQUIVALENCE CLASSES; POLYNOMIAL APPROXIMATION;

ARBITRARY GRAPHS; CONNECTED GRAPH; EDGE DISJOINT PATHS; INCREMENTAL MAINTENANCE; POLYNOMIAL-TIME; UNDIRECTED GRAPH;

GRAPH THEORY;

EID: 84927804736     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44985-X     Document Type: Conference Paper

References (20)

1. A. A. Benczur, “Augmenting undirected connectivity in ~O(n3) time", Proc. 26th Annual ACM Symp. on Theory of Computing, ACM Press, 1994, 658-667.
2. A. A. Benczur, “The structure of near-minimum edge cuts", In Proc. 36st Annual Symp. on Foundations of Computer Science, 1995, 92-102.
3. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms, McGraw-Hill, New York, NY, 1990.
4. Ye. Dinitz, “The 3-edge components and the structural description of all 3-edge cuts in a graph", Proc. 18th International Workshop on Graph-Theoretic Concepts in Computer Science (WG92), Lecture Notes in Computer Science, v.657, Springer-Verlag, 1993, 145-157.
5. Ye. Dinitz, “The 3-edge components and the structural description of edge cuts in a graph", Manuscript.
6. E. A. Dinic, A. V. Karzanov and M. V. Lomonosov, “On the structure of the system of minimum edge cuts in a graph", Studies in Discrete Optimization, A. A. Fridman (Ed.), Nauka, Moscow, 1976, 290-306 (in Russian).
7. Ye. Dinitz and Z. Nutov, “A 2-level cactus tree model for the minimum and minimum+ 1 edge cuts in a graph and its incremental maintenance", Proc. the 27th Symposium on Theory of Computing, 1995, 509-518.
8. Ye. Dinitz and A. Vainshtein, “The connectivity carcass of a vertex subset in a graph and its incremental maintenance", Proc. 26th Annual ACM Symp. on Theory of Computing, ACM Press, 1994, 716-725 (see also TR-CS0804 and TR-CS0921, Technion, Haifa, Israel).
9. Ye. Dinitz and J. Westbrook, “Maintaining the Classes of 4-Edge-Connectivity in a Graph On-Line", Algorithmica 20 (1998), no. 3, 242-276.
10. H. N. Gabow, “Applications of a poset representation to edge connectivity and graph rigidity", Proc. 23rd Annual ACM Symp. on Theory of Computing, 1991, 112-122.
11. R. E. Gomory and C. T. Hu, “Multi-terminal network flows", J. SIAM 9(4) (1961), 551-570.
12. Z. Galil and G. F. Italiano, “Maintaining the 3-edge-connected components of a graph on line", SIAM J. Computing 22 (1), 1993, 11-28.
13. F. Harary. Graph Theory, Addison-Wesley, Reading, MA, 1972.
14. Hopcroft, J., and Tarjan, R.E., Dividing a graph into triconnected components. SIAM J. Comput. 2 (1973) 135-158.
15. J. A. La Poutré, J. van Leeuwen, and M. H. Overmars. Maintenance of 2-and 3-edge-connected components of graphs. Discrete Mathematics 114, 1993, 329-359.
16. D. Naor, D. Guisfield and C. Martel, “A fast algorithm for optimally increasing the edge connectivity", In Proc. 31st Annual Symp. on Foundations of Computer Science, 1990, 698-707.
17. D. D. Sleator and R. E. Tarjan, “A data structure for the dynamic trees", In Proc. 13th Annual ACM Symposium on Theory of Computing, 1981, 114-122.
18. Tutte, W.T., Connectivity in Graphs, Univ. of Toronto Press, Toronto, 1966.
19. Teplixke, R.,2 Dynamic Maintenance of Connectivity Classes of a Graph, Using Decomposition into 3-Components, M. Sc. Thesis, the Technion, Haifa, Israel, 1999.
20. J. Westbrook and R. E. Tarjan, “Maintaining bridge-connected and biconnected components on line", Algorithmica, 7 (1992), 433-464.