arXiv · cs/0205011
On Strongly Connected Digraphs with Bounded Cycle Length
Abstract
The MEG (minimum equivalent graph) problem is, given a directed graph, to find a small subset of the edges that maintains all reachability relations between nodes. The problem is NP-hard. This paper gives a proof that, for graphs where each directed cycle has at most three edges, the MEG problem is equivalent to maximum bipartite matching, and therefore solvable in polynomial time. This leads to an improvement in the performance guarantee of the previously best approximation algorithm for the general problem in ``Approximating the Minimum Equivalent Digraph'' (1995).
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Samir Khuller, Balaji Raghavachari, Neal Young. 2002-05-10. On Strongly Connected Digraphs with Bounded Cycle Length. https://doi.org/10.1016/0166-218x(95)00105-z. https://searcharxiv.com/abs/cs/0205011
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.