Location of Repository

The Structure of Near-Minimum Edge Cuts

By Andras A. Benczur

Abstract

Let G be an undirected k-edge connected graph. In this paper we give a representation for all edge cuts with capacity not exceeding roughly 6 5 k. This generalizes the cactus representation #Dinits et al# for all minimum cuts. Karger proved that the number of cuts within a multiplicative factor # of the connectivity is at most O#n #. We improve this bound to O#n # for # =6=5

Topics: Key words, minimum cuts, edge connectivity, edge splitting-o, graph algorithms
Year: 1995
OAI identifier: oai:CiteSeerX.psu:10.1.1.18.5524
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.lcs.mit.edu/publica... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.