Reordering the reorderable matrix as an algorithmic problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1889, Issue , 2000, Pages 453-468

  Mäkinen, Erkki ^a   Siirtola, Harri ^a  

^a TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS);

ALGORITHMIC PROBLEMS; GRAPH DRAWING; GRAPH DRAWING ALGORITHMS; REORDERABLE MATRIX; SIMPLE HEURISTICS; TABULAR DATA; VISUALIZATION METHOD;

DATA VISUALIZATION;

EID: 84942921956     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44590-0_37     Document Type: Conference Paper

References (15)

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).
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).
3. P. Z. Chinn, J. Chvátalová, A. K. Dewdney, and N. E. Gibbs, The bandwidth problem for graphs and matrices–a survey. J. Graph Theory 6 (1992), 223–254.
4. G. Di Battista, P. Eades, R. Tamassia and I. G. Tollis, Annotated bibliography on graph drawing algorithms. Comput. Geom. Theory Appl. 4 (1994) 235–282.
5. J. M. Dill, Optimal trie compaction is NP-complete. Cornell University, Dept. of Computer Science, Report 87-814, March 1987.
6. P. Eades and N. Wormald, Edge crossings in drawings of bipartite graphs. Algorithmica 10 (1994), 361–374.
7. M. R. Garey, R. L. Graham, D. S. Johnson, and D. E. Knuth, Complexity results for bandwidth minimization. SIAM J. Appl. Math. 34 (1978), 477–495.
8. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman, 1979.
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.
10. M. Jünger and P. Mutzel, 2-layer straightline crossing minimization: performance of exact and heuristic algorithms. J. Graph Algorithms and Applications 1 (1997), 1–25.
11. J. Katajainen and E. Mäkinen, A note on the complexity of trie compaction. EATCS Bull. 41 (1990), 212–216.
12. D. J. Rose and R. E. Tarjan, Algorithmic aspects of vertex elimination of directed graphs. SIAM J. Appl. Math. 34 (1978), 176–197.
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.
14. K. Sugiyama, S. Tagawa, and M. Toda, Methods for visual understanding of hierarchical system structures. IEEE Trans. Syst. Man Cybern. SMC-11 (1981), 109–125.
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.