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
MGV: A System for Visualizing Massive Multidigraphs
IEEE Transactions on Visualization and Computer Graphics
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs
GD '96 Proceedings of the Symposium on Graph Drawing
Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Multilevel Visualization of Clustered Graphs
GD '96 Proceedings of the Symposium on Graph Drawing
Visualizing Massive Multi-Digraphs
INFOVIS '00 Proceedings of the IEEE Symposium on Information Vizualization 2000
INFOVIS '01 Proceedings of the IEEE Symposium on Information Visualization 2001 (INFOVIS'01)
A Fast Multi-Scale Method for Drawing Large Graphs
A Fast Multi-Scale Method for Drawing Large Graphs
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
| Hi-index | 0.01 |
An effective way to process a graph that does not fit in RAM is to build a hierarchical partition of its set of vertices. This hierarchy induces a partition of the graph edge set. We use this partition to produce a macro view of the graph. A screen embedding of this macro view is a Graph Sketch. We describe the use of Rectangular FishEye Views to provide drill-down navigation of graph sketches at different levels of detail including the graph edges data. A higher level of detail of a sketch focus area is obtained by distorting the lower detail context. Alternative visual representations can be used at different sketch hierarchy levels. We provide two sketch screen embeddings. One is tree-map based and the other is obtained by a special sequence of graph edge contractions. We demonstrate the application of our current Unix/Windows prototype to telecommunication graphs with edge sets ranging from 100 million to 1 billion edges(Giga-Graphs). To our knowledge this is the first time that focus within context techniques have been used successfully for the navigation of external memory graphs.