Approximating Transitivity in Directed Networks

We consider the minimum equivalent digraph (directed network) problem (also known as the strong transitive reduction) and its maximum objective function variant, with two types of extensions. First, we allow to declare set D E and require that a valid solution A satisfies D A (it is sometimes called transitive reduction problem). In the second extension (called p-ary transitive reduction), we have integer edge labeling and we view two paths as equivalent if they have the same beginning, ending and the sum of labels modulo p. A solution A E is valid if it gives an equivalent path for every original path. For all problems we establish the

• Type: Journal
• Year: 2008
• Where: CORR
• Authors: Piotr Berman, Bhaskar DasGupta, Marek Karpinski
• Keywords: CORR 2008, Education, Strong Transitive Reduction, Transitive Reduction, Transitive Reduction Problem