Sciweavers

2304 search results - page 32 / 461
» On the Vulnerability of Large Graphs
Sort
View
ISM
2006
IEEE
122views Multimedia» more  ISM 2006»
14 years 3 months ago
SuperGraph Visualization
Given a large social or computer network, how can we visualize it, find patterns, outliers, communities? Although several graph visualization tools exist, they cannot handle larg...
José Fernando Rodrigues Jr., Agma J. M. Tra...
HIPC
2007
Springer
14 years 3 months ago
Accelerating Large Graph Algorithms on the GPU Using CUDA
Abstract. Large graphs involving millions of vertices are common in many practical applications and are challenging to process. Practical-time implementations using high-end comput...
Pawan Harish, P. J. Narayanan
INFOVIS
1997
IEEE
14 years 1 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
PVLDB
2010
149views more  PVLDB 2010»
13 years 8 months ago
GRAIL: Scalable Reachability Index for Large Graphs
Given a large directed graph, rapidly answering reachability queries between source and target nodes is an important problem. Existing methods for reachability trade-off indexing ...
Hilmi Yildirim, Vineet Chaoji, Mohammed Javeed Zak...
GD
2004
Springer
14 years 3 months ago
Visualizing Large Graphs with Compound-Fisheye Views and Treemaps
Compound-fisheye views are introduced as a method for the display and interaction with large graphs. The method relies on a hierarchical clustering of the graph, and a generalizat...
James Abello, Stephen G. Kobourov, Roman Yusufov