Sciweavers

108 search results - page 5 / 22
» Hybrid Transitive Closure Algorithms
Sort
View
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,...
PODS
2008
ACM
143views Database» more  PODS 2008»
15 years 9 months ago
XPath, transitive closure logic, and nested tree walking automata
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
Balder ten Cate, Luc Segoufin
PROPERTYTESTING
2010
14 years 7 months ago
Transitive-Closure Spanners: A Survey
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 ...
Sofya Raskhodnikova
CDC
2010
IEEE
141views Control Systems» more  CDC 2010»
14 years 4 months ago
Hybrid moment computation algorithm for biochemical reaction networks
Moment computation is essential to the analysis of stochastic kinetic models of biochemical reaction networks. It is often the case that the moment evolution, usually the first and...
Yun-Bo Zhao, Jongrae Kim, João Pedro Hespan...
VLDB
2005
ACM
82views Database» more  VLDB 2005»
15 years 3 months ago
Stack-based Algorithms for Pattern Matching on DAGs
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...
Li Chen, Amarnath Gupta, M. Erdem Kurul