Bhalgat, Anand ; Hariharan, Ramesh
(2009)
*Fast edge orientation for unweighted graphs*
In: SODA '09 Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, January 04-06, 2009, New York, New York.

Full text not available from this repository.

Official URL: http://dl.acm.org/citation.cfm?id=1496800

## Abstract

We consider an unweighted undirected graph with n vertices, m edges, and edge-connectivity 2k. The weak edge orientation problem requires that the edges of this graph be oriented so the resulting directed graph is at least k edge-connected. Nash-Williams proved the existence of such orientations and subsequently Frank [6], Gabow [7], and Nagamochi-Ibaraki [12] gave algorithmic constructions. All of these algorithms took time at least quadratic in n. We provide the first sub-quadratic (in n) algorithm for this problem. Our algorithm takes Õ(nk4 + m) time. This improves the previous best bounds of Õ(n2k2 + m) by Gabow [7] and Õ(n2m) by Nagamochi-Ibaraki [12] when k ≤ √n. Indeed, many real networks have k ≪ n.Our algorithm uses the fast edge splitting paradigm introduced by Bhalgat et al. [2]. We seek to split out a large fraction of the vertices, recurse on the resulting graph, and then put back the split-off vertices. The main challenge we face is that only vertices with even degree may be split-off in an undirected graph and there may not be any such vertex in the current graph. The edge orientation algorithms of Gabow and Nagamochi-Ibaraki as well as Frank's proof are based on showing the existence of at least two even degree vertices (in fact, vertices with degree 2k) in a 2k minimally connected graph. We generalize this to show that in any edge minimal 2k edge-connected graph, there are at least n/3 even degree vertices. These vertices are then split-off.Our next challenge is to drop edges from the given graph so it remains 2k connected and yet has Ω(n) even degree vertices. We provide an algorithm that discards edges specifically to produce Ω(n) even degree vertices while maintaining connectivity 2k and takes time Õ(nk4 + m). Note that this algorithm does not necessarily make the graph edge-minimally 2k edge-connected. We also briefly outline an Õ(nk5 + m) time algorithm that achieves edge-minimality which improves the previous best bound of Õ(m + n2k2) by Gabow [7].

Item Type: | Conference or Workshop Item (Paper) |
---|---|

Source: | Copyright of this article belongs to ACM, Inc. |

ID Code: | 102362 |

Deposited On: | 09 Mar 2018 11:27 |

Last Modified: | 09 Mar 2018 11:27 |

Repository Staff Only: item control page