On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
External memory algorithms
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs
GD '96 Proceedings of the Symposium on Graph Drawing
Improved Algorithms and Data Structures for Solving Graph Problems in External Memory
SPDP '96 Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)
Visualizing Massive Multi-Digraphs
INFOVIS '00 Proceedings of the IEEE Symposium on Information Vizualization 2000
MGV: A System for Visualizing Massive Multidigraphs
IEEE Transactions on Visualization and Computer Graphics
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
A framework for visual data mining of structures
ACSC '06 Proceedings of the 29th Australasian Computer Science Conference - Volume 48
Visual Analysis of Large Heterogeneous Social Networks by Semantic and Structural Abstraction
IEEE Transactions on Visualization and Computer Graphics
Proceedings of the Working Conference on Advanced Visual Interfaces
Visualizing large graphs with compound-fisheye views and treemaps
GD'04 Proceedings of the 12th international conference on Graph Drawing
GD'11 Proceedings of the 19th international conference on Graph Drawing
StreamEB: stream edge bundling
GD'12 Proceedings of the 20th international conference on Graph Drawing
| Hi-index | 0.00 |
We introduce the notion of Graph Sketches. They can be thought of as visual indices that guide the navigation of a multi-graph too large to fit on the available display. We adhere to the Visual Information-Seeking Mantra: Overview first, zoom and filter, then details on demand. Graph Sketches are incorporated into MGV, an integrated visualization and exploration system for massive multi-digraph navigation. We highlight the main algorithmic and visualization tasks behind the computation of Graph Sketches and illustrate several application scenarios. Graph Sketches will be used to guide the navigation of multi-digraphs defined on vertex sets with sizes ranging from 100 to 250 million vertices.