@article {15221,
title = {On strongly connected digraphs with bounded cycle length},
journal = {Discrete Applied Mathematics},
volume = {69},
year = {1996},
month = {1996/08/27/},
pages = {281 - 289},
abstract = {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.},
isbn = {0166-218X},
doi = {10.1016/0166-218X(95)00105-Z},
url = {http://www.sciencedirect.com/science/article/pii/0166218X9500105Z},
author = {Khuller, Samir and Raghavachari,Balaji and Young,Neal}
}