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.

[1]  Jacques Bertin,et al.  Graphics and graphic information-processing , 1981 .

[2]  H. S. Wilf.  Combinatorics, Geometry and Probability: On Crossing Numbers, and some Unsolved Problems , 1997 .

[3]  John J. Bertin,et al.  The semiology of graphics , 1983 .

[4]  David S. Johnson,et al.  COMPLEXITY RESULTS FOR BANDWIDTH MINIMIZATION , 1978 .

[5]  Harri Siirtola,et al.  Interaction with the Reorderable Matrix , 1999, 1999 IEEE International Conference on Information Visualization (Cat. No. PR00210).

[6]  Ioannis G. Tollis,et al.  Algorithms for Drawing Graphs: an Annotated Bibliography , 1988, Comput. Geom..

[7]  Erkki Mäkinen,et al.  A note on the complexity of trie compaction , 1990, Bull. EATCS.

[8]  Mitsuhiko Toda,et al.  Methods for Visual Understanding of Hierarchical System Structures , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[9]  Norman E. Gibbs,et al.  The bandwidth problem for graphs and matrices - a survey , 1982, J. Graph Theory.

[10]  Michael Jünger,et al.  Journal of Graph Algorithms and Applications 2-layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms , 2022 .

[11]  Robert E. Tarjan,et al.  Algorithmic aspects of vertex elimination , 1975, STOC.

[12]  Jens M. Dill.  Optimal Trie Compaction is NP-Complete , 1987 .

[13]  W. Hays.  Semiology of Graphics: Diagrams Networks Maps. , 1985 .

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .