Sciweavers

2 search results - page 1 / 1
» Computationally efficient sup-t transitive closure for spars...
Sort
View
FSS
2006
81views more  FSS 2006»
14 years 9 months ago
Computationally efficient sup-t transitive closure for sparse fuzzy binary relations
Manolis Wallace, Yannis S. Avrithis, Stefanos D. K...
APPROX
2010
Springer
168views Algorithms» more  APPROX 2010»
14 years 11 months ago
Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners
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...
Arnab Bhattacharyya, Elena Grigorescu, Madhav Jha,...