Introduction to graph theory
An algorithm for drawing general undirected graphs
Information Processing Letters
MGV: A System for Visualizing Massive Multidigraphs
IEEE Transactions on Visualization and Computer Graphics
Reducing the bandwidth of sparse symmetric matrices
ACM '69 Proceedings of the 1969 24th national conference
MatrixExplorer: a Dual-Representation System to Explore Social Networks
IEEE Transactions on Visualization and Computer Graphics
Using multilevel call matrices in large software projects
INFOVIS'03 Proceedings of the Ninth annual IEEE conference on Information visualization
Visualization based policy analysis: case study in SELinux
Proceedings of the 13th ACM symposium on Access control models and technologies
A survey of multiple tree visualisation
Information Visualization
TreeMatrix: A Hybrid Visualization of Compound Graphs
Computer Graphics Forum
TreeMatrix: A Hybrid Visualization of Compound Graphs
Computer Graphics Forum
EuroVis'11 Proceedings of the 13th Eurographics / IEEE - VGTC conference on Visualization
Spatially efficient design of annotated metro maps
EuroVis '13 Proceedings of the 15th Eurographics Conference on Visualization
Hi-index | 0.00 |
For displaying a dense graph, an adjacency matrix is superior than a node-link diagram because it is more compact and free of visual clutter. A node-link diagram, however, is far better for the task of path finding because a path can be easily traced by following the corresponding links, provided that the links are not heavily crossed or tangled. We augment adjacency matrices with path visualization and associated interaction techniques to facilitate path finding. Our design is visually pleasing, and also effectively displays multiple paths based on the design commonly found in metro maps. We illustrate and assess the key aspects of our design with the results obtained from two case studies and an informal user study.