Work

On strongly connected digraphs with bounded cycle length

Year: 1996

Type: article

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.

Source: Discrete Applied Mathematics

DOI: 10.1016/0166-218x(95)00105-z

Authors: Samir Khuller, Balaji Raghavachari, Neal Young

Institutions: University of Maryland, College Park, The University of Texas at Dallas, Dartmouth College

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $3,090

OpenAlex ID: W2021924280

FWCI:

Cites: 7

Cited by: 31

Related to: