Incremental Maintenance of the 5-Edge-Connectivity Classes of a Graph

This publication has 15 references indexed in Scilit:

• Maintaining the Classes of 4-Edge-Connectivity in a Graph On-Line
  Algorithmica, 1998
• A 2-level cactus model for the system of minimum and minimum+1 edge-cuts in a graph and its incremental maintenance
  Published by Association for Computing Machinery (ACM) ,1995
• The connectivity carcass of a vertex subset in a graph and its incremental maintenance
  Published by Association for Computing Machinery (ACM) ,1994
• Maintenance of 2- and 3-edge- connected components of graphs I
  Discrete Mathematics, 1993
• Maintaining the 3-Edge-Connected Components of a Graph On-Line
  SIAM Journal on Computing, 1993
• The 3-edge-components and a structural description of all 3-edge-cuts in a graph
  Published by Springer Nature ,1993
• A data structure for dynamic trees
  Published by Association for Computing Machinery (ACM) ,1981
• Dividing a Graph into Triconnected Components
  SIAM Journal on Computing, 1973
• Recent results on generalized Ramsey theory for graphs
  Published by Springer Nature ,1972
• Multi-Terminal Network Flows
  Journal of the Society for Industrial and Applied Mathematics, 1961