23 search results - page 1 / 5 » Approximating Transitive Reductions for Directed Networks |
CORR
2008
Springer
13 years 4 months ago
2008
Springer
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...
WADS
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We consider minimum equivalent digraph problem, its maximum optimization variant and some non-trivial extensions of these two types of problems motivated by biological an...
ALGORITHMICA
2008
13 years 4 months ago
2008
In this paper we consider the p-ary transitive reduction (TRp) problem where p > 0 is an integer; for p = 2 this problem arises in inferring a sparsest possible (biological) sig...
COCOON
2001
Springer
13 years 9 months ago
2001
Springer
We present a simple space saving trick that applies to many previous algorithms for transitive closure and shortest paths in dynamic directed graphs. In these problems, an update c...
VLSID
2006
IEEE
14 years 5 months ago
2006
IEEE
Serial links in network on chip provide advantages in terms of reduced wiring area, reduced switch complexity and power. However, serial links offer lower bandwidth in comparison ...