Sciweavers

RP
2010
Springer
163views Control Systems» more  RP 2010»
13 years 2 months ago
Efficient Graph Reachability Query Answering Using Tree Decomposition
Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data ...
Fang Wei
INFOVIS
1997
IEEE
13 years 9 months ago
H3: laying out large directed graphs in 3D hyperbolic space
We present the H3 layout technique for drawing large directed graphs as node-link diagrams in 3D hyperbolic space. We can lay out much larger structures than can be handled using ...
Tamara Munzner
PDP
2007
IEEE
13 years 11 months ago
Parallel-External Computation of the Cycle Structure of Invertible Cryptographic Functions
We present an algorithm to compute the cycle structure of large directed graphs where each node has exactly one outgoing edge. Such graphs appear as state diagrams of finite stat...
Andreas Beckmann, Jorg Keller
SIGMOD
2008
ACM
111views Database» more  SIGMOD 2008»
14 years 5 months ago
Efficiently answering reachability queries on very large directed graphs
Ruoming Jin, Yang Xiang, Ning Ruan, Haixun Wang