Algorithms for drawing graphs: an annotated bibliography
Computational Geometry: Theory and Applications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Interaction with the Reorderable Matrix
IV '99 Proceedings of the 1999 International Conference on Information Visualisation
Optimal Trie Compaction is NP-Complete
Optimal Trie Compaction is NP-Complete
Semiology of graphics
CoDA: interactive cluster based concept discovery
Proceedings of the VLDB Endowment
Exploring high-D spaces with multiform matrices and small multiples
INFOVIS'03 Proceedings of the Ninth annual IEEE conference on Information visualization
TVi: a visual querying system for network monitoring and anomaly detection
Proceedings of the 8th International Symposium on Visualization for Cyber Security
TreeMatrix: A Hybrid Visualization of Compound Graphs
Computer Graphics Forum
TreeMatrix: A Hybrid Visualization of Compound Graphs
Computer Graphics Forum
Twelve years of diagrams research
Journal of Visual Languages and Computing
| Hi-index | 0.00 |
The Reorderable Matrix is a visualization method for tabular data. This paper deals with the algorithmic problems related to ordering the rows and columns in a Reorderable Matrix. We establish links between ordering the matrix and the well-known and much studied problem of drawing graphs. First, we show that, as in graph drawing, our problem allows different aesthetic criterions which reduce to known NP-complete problems. Second, we apply and compare two simple heuristics to the problem of reordering the Reorderable Matrix: a two-dimensional sort and a graph drawing algorithm.