On strongly connected digraphs with bounded cycle length

TitleOn strongly connected digraphs with bounded cycle length
Publication TypeJournal Articles
Year of Publication1996
AuthorsKhuller S, Raghavachari B, Young N
JournalDiscrete Applied Mathematics
Volume69
Issue3
Pagination281 - 289
Date Published1996/08/27/
ISBN Number0166-218X
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.

URLhttp://www.sciencedirect.com/science/article/pii/0166218X9500105Z
DOI10.1016/0166-218X(95)00105-Z