2 search results - page 1 / 1 » Computationally efficient sup-t transitive closure for spars... |
FSS
2006
14 years 10 months ago
2006
APPROX
2010
Springer
15 years 13 hour ago
2010
Springer
Abstract. Given a directed graph G = (V, E) and an integer k 1, a ktransitive-closure-spanner (k-TC-spanner) of G is a directed graph H = (V, EH ) that has (1) the same transitive...