The 3-edge-components and a structural description of all 3-edge-cuts in a graph

  • Efim Dinitz
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 657)


Let G = (V, E) be an undirected graph, ¦V¦ = n. We denote Vl the partition of V into maximal vertex subsets indivisible by k(-edge)-cuts, k < l, of the whole G. The factor-graph of G corresponding to V3, is known to give a clear representation of V2, V3 and of the system of cuts of G with 1 and 2 edges. Here a (graph invariant) structural description of V4 and of the system of 3-cuts in an arbitrary graph G is suggested. It is based on a new concept of the 3-edge-connected components of a graph (with vertex sets from V3). The 3-cuts of G are classified so that the classes are naturally 1∶1 correspondent to the 3-cuts of the 3-edge-connected components. A class can be reconstructed in a simple way from the component cut, using the relation of the component to the system of 2-cuts of G. For 3-cuts and V4 of a 3-edge-connected graph we follow [DKL76]. The space complexity of the description suggested is O(n) (though the total number of 3-cuts may be a cubic function of n).


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [DKL76]
    Dinic, E. A., Karzanov, A. V. and Lomonosov, M. V.: On the structure of the system of minimum edge cuts in a graph. In Studies in Discrete Optimization, A. A. Fridman (Ed.), Nauka, Moscow, 1976, 290–306 (in Russian)Google Scholar
  2. [G91]
    Gabow, H.N.: Application of a poset representation to edge connectivity and graph rigidity. Proc. 32st Annual Symp. on Foundations of Computer Science, 1991, 812–820Google Scholar
  3. [GI91]
    Galil, Z., and Italiano, G. F.: Fully dynamic algorithms for edge connectivity problems. Proc. 23rd Annual ACM Symp. on Theory of Computing, 1991, 317–327Google Scholar
  4. [GI92]
    Galil, Z. and Italiano, G. F.: Maintaining the 3-edge-connected components of a graph on-line. SIAM J. Comput., to appearGoogle Scholar
  5. [HT73]
    Hopcroft, J., and Tarjan, R.E.: Dividing a graph into triconnected components. SIAM J. Comput. 2 (1973) 135–158Google Scholar
  6. [KT86]
    Karzanov, A.V. and Timofeev, E. A.: Efficient algorithm for finding all minimal edge cuts of a non-oriented graph. Cybernetics, 156–162. Translated from Kibernetica, No. 2, 1986, 8–12Google Scholar
  7. [KTBC91]
    Kanevsky, A., Tamassia, R., Battista, G. Di and Chen, J. On-line maintenance of the four-connected components of a graph. Proc. 32st Annual Symp. on Foundations of Computer Science, 1991, 793–801Google Scholar
  8. [NGM90]
    Naor, D., Gusfield, D. and Martel, C.: A fast algorithm for optimally increasing the edge-connectivity. Proc. 31st Annual Symp. on Foundations of Computer Science, 1990, 698–707Google Scholar
  9. [NV91]
    Naor, D., Vazirani, V.V.: Representing and enumerating edge-connectivity cuts in RNC. Technical Report CSE-91-22, Division of Computer Science, UC Davis (1991). Appeared also in Proc. of the 1991 Workshop on Algorithms and Data Structures, Ottawa, CanadaGoogle Scholar
  10. [T66]
    Tutte, W.T.: Connectivity in Graphs. Univ. of Toronto Press, Toronto, 1966Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Efim Dinitz
    • 1
  1. 1.Department of Computer ScienceTechnionHaifaIsrael

Personalised recommendations