Reordering the Reorderable Matrix as an Algorithmic Problem
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.
KeywordsBipartite Graph Black Area Algorithmic Problem Graph Drawing Bandwidth Minimization
Unable to display preview. Download preview PDF.
- 1.J. Bertin. Graphics and Graphic Information Processing. Walter de Gruyter & Co., Berlin, 1981. (Originally La graphique et le traitemente graphique de l’information, 1967, translated in English by William J. Berg and Paul Scott).Google Scholar
- 2.J. Bertin. Semiology of Graphics-Diagrams Networks Maps. The University of Wisconsin Press, 1983. (Originally Sémiologue graphique, 1967, translated in English by William J. Berg).Google Scholar
- 5.J. M. Dill, Optimal trie compaction is NP-complete. Cornell University, Dept. of Computer Science, Report 87-814, March 1987.Google Scholar
- 8.M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman, 1979.Google Scholar
- 9.H. Hinterberger and C. Schmid, Reducing the influence of biased graphical perception with automatic permutation matrices. In Proceedings of the Seventh Conference on Scientific Use of Statistic-Software, SoftStat93, Heidelberg. Gustav Fischer Verlag, Stuttgart, 1993, pages 285–291.Google Scholar
- 13.H. Siirtola. Interaction with the Reorderable Matrix. In E. Banissi, F. Khosrowshahi, M. Sarfraz, E. Tatham, and A. Ursyn, editors, Information Visualization IV’99, pages 272–277. Proceedings International Conference on Information Visualization, IEEE Computer Society, July 1999. http://www.cs.uta.fi/~hs/iv99/siirtola.pdf.
- 15.H. S. Wilf, On crossing numbers, and some unsolved problems. B. Bollobás and A. Thomason (eds), Combinatorics, Geometry, and Probability: A Tribute to Paul Erdös. Papers from the Conference in Honor of Erdös’ 80th Birthday Held at Trinity College, Cambridge University Press, 1997, pages 557–562.Google Scholar