TY - JOUR
T1 - On strongly connected digraphs with bounded cycle length
JF - Discrete Applied Mathematics
Y1 - 1996
A1 - Khuller, Samir
A1 - Raghavachari,Balaji
A1 - Young,Neal
AB - Given a directed graph G = (V, E), a natural problem is to choose a minimum number of the edges in E such that, for any two vertices u and v, if there is a path from u to v in E, then there is a path from u to v among the chosen edges. We show that in graphs having no directed cycle with more than three edges, this problem is equivalent to Maximum Bipartite Matching. This leads to a small improvement in the performance guarantee of the previous best approximation algorithm for the general problem.
VL - 69
SN - 0166-218X
UR - http://www.sciencedirect.com/science/article/pii/0166218X9500105Z
CP - 3
M3 - 10.1016/0166-218X(95)00105-Z
ER -