200 search results - page 5 / 40 » Fast Computation of Reachability Labeling for Large Graphs |
EDBT
2009
ACM
15 years 2 months ago
2009
ACM
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
SENSYS
2003
ACM
15 years 3 months ago
2003
ACM
The widespread deployment of sensor networks is on the horizon. One of the main challenges in sensor networks is to process and aggregate data in the network rather than wasting e...
GD
2000
Springer
15 years 1 months ago
2000
Springer
We present a multi-scale layout algorithm for the aesthetic drawing of undirected graphs with straight-line edges. The algorithm is extremely fast, and is capable of drawing graph...
KDD
2007
ACM
15 years 10 months ago
2007
ACM
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
VIZSEC
2007
Springer
15 years 3 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...