A Matroid Approach to Finding Edge Connectivity and Packing Arborescences

@inproceedings{Gabow1991AMA,
  title={A Matroid Approach to Finding Edge Connectivity and Packing Arborescences},
  author={Harold N. Gabow},
  booktitle={STOC},
  year={1991}
}
We present an algorithm that finds the edge connect ivity A of a directed graph in time O(Arn log (n2/rn)) and is slightly faster on an undi-rected graph (n and m denote the number of vertices a " nd edgea, respectively). This improves the previous best time bounds, O(min{rnn, Aznz}) on a directed graph and 0(An2) on undirected. We present an algorithm that finds k edge-disjoint arborescences on a directed graph in time 0((kn)2). This improves the previous best time bound, O(kmrt + k3n2… CONTINUE READING

From This Paper

Topics from this paper.

Similar Papers

Loading similar papers…