103 search results - page 3 / 21 » Direct Algorithms for Computing the Transitive Closure of Da... |
PROPERTYTESTING
2010
13 years 5 months ago
2010
We survey results on transitive-closure spanners and their applications. Given a directed graph G = (V, E) and an integer k 1, a k-transitive-closure-spanner (k-TC-spanner) of G ...
VLDB
2005
ACM
14 years 1 months ago
2005
ACM
Existing work for query processing over graph data models often relies on pre-computing the transitive closure or path indexes. In this paper, we propose a family of stack-based a...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Discrete temporal transitions occur in a variety of domains, but this work is mainly motivated by applications in molecular biology: explaining and analyzing observed transcriptome...
ICDE
2007
IEEE
14 years 2 months ago
2007
IEEE
User-defined preferences allow personalized ranking of query results. A user provides a declarative specification of his/her preferences, and the system is expected to use that ...
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...