Annals of Mathematics and Artificial Intelligence
Pairing Transitive Closure and Reduction to Efficiently Reason about Partially Ordered Events
AI*IA '99 Proceedings of the 6th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
Implementations and experimental studies of dynamic graph algorithms
Experimental algorithmics
Markov Processes Involving q-Stirling Numbers
Combinatorics, Probability and Computing
An efficient graph algorithm for dominance constraints
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Efficiently answering reachability queries on very large directed graphs
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
A Path Cover Technique for LCAs in Dags
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
3-HOP: a high-compression indexing scheme for reachability query
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
An abstract domain extending difference-bound matrices with disequality constraints
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Fast lowest common ancestor computations in dags
ESA'07 Proceedings of the 15th annual European conference on Algorithms
A hierarchical approach to reachability query answering in very large graph databases
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
What consistency does your key-value store actually provide?
HotDep'10 Proceedings of the Sixth international conference on Hot topics in system dependability
Path-tree: An efficient reachability indexing scheme for large directed graphs
ACM Transactions on Database Systems (TODS)
BMC: an efficient method to evaluate probabilistic reachability queries
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Journal of Biomedical Informatics
I/O cost minimization: reachability queries processing over massive graphs
Proceedings of the 15th International Conference on Extending Database Technology
Access control in social networks: a reachability-based approach
Proceedings of the 2012 Joint EDBT/ICDT Workshops
K-reach: who is in your small world
Proceedings of the VLDB Endowment
TF-Label: a topological-folding labeling scheme for reachability querying in a large graph
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Fast and scalable reachability queries on graphs by pruned labeling with landmarks and paths
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Simple, fast, and scalable reachability oracle
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |