189 search results - page 2 / 38 » SCARAB: scaling reachability computation on large graphs |
CIKM
2010
Springer
13 years 3 months ago
2010
Springer
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...
EDBT
2006
ACM
14 years 5 months ago
2006
ACM
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
EDBT
2008
ACM
14 years 5 months ago
2008
ACM
VIZSEC
2007
Springer
13 years 11 months ago
2007
Springer
Abstract Attack graphs for large enterprise networks improve security by revealing critical paths used by adversaries to capture network assets. Even with simplification, current a...
ICDCN
2011
Springer
12 years 8 months ago
2011
Springer
Distributed processing of real-world graphs is challenging due to their size and the inherent irregular structure of graph computations. We present HIPG, a distributed framework th...