A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Transitive-Closure Spanners of the Hypercube and the Hypergrid
[article]

2009
*
Electronic colloquium on computational complexity
*

Given a directed graph G = (V, E) and an integer k ≥ 1, a k-transitive-closure-spanner (k-TCspanner) of G is a directed graph H = (V, E H ) that has (1) the same transitive-closure as G and (2) diameter at most k. Transitive-closure spanners were introduced in [7] as a common abstraction for applications in access control, property testing and data structures. In this work we study the number of edges in the sparsest 2-TC-spanners for the directed hypercube {0, 1} d and hypergrid {1, 2, . . . ,

dblp:journals/eccc/BhattacharyyaGJRW09
fatcat:aaaknf57qvh63eujjol2t2wbxm