A comparison of vertex ordering algorithms for large graph visualization

Asia-Pacific Symposium on Visualisation 2007, APVIS 2007, Proceedings

Volumn , Issue , 2007, Pages 141-148

  Mueller, Christopher ^a   Martin, Benjamin ^a   Lumsdaine, Andrew ^a  

^a INDIANA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORETIC ALGORITHMS; INTERNAL STRUCTURE; LARGE GRAPH VISUALIZATION; VERTEX ORDERING ALGORITHMS;

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; DATA REDUCTION; VISUAL COMMUNICATION; VISUALIZATION;

GRAPH THEORY;

EID: 34547302314     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/APVIS.2007.329289     Document Type: Conference Paper

References (39)

1. James Abello, Irene Finocchi, and Jeffrey Korn. Graph sketches. In IEEE, editor, Proceedings of the IEEE Symposiom on Information Visualization, San Diego, CA, 2001.
2. Fernando L. Alvarado. The sparse matrix manipulation system user and reference manual. Technical report, The University of Wisconsin, May 1993.
3. Michael W. Berry, Bruce Hendrickson, and Padma Raghavan. Sparse Matrix Reordering Schemes for Browsing Hypertext, volume 32 of Lectures in Applied Mathematics. American Mathematical Society, 1996.
4. D. Blandford, G. Blelloch, and I. Kash. Compact representations of separable graphs. In In Proc. ACM-SIAM Symposium on Discrete Algorithms, 2003.
5. Mollnspiration Cheminformatics. Molinspiration toolkit. Web site. Accessed March 22, 2006.
6. Kwangmin Choi, JeongHyun Choi Yu Ma, and Sun Kim. PLATCOM: A Platform for Computational Comparative Genomics. Bioinformatics, 21(10):2514-2516, 2005.
7. Wouter de Nooy, Andrej Mrvar, and Vladimir Batagelj. Exploratory Social Network Analysis with Pajek. Cambridge University Press, New York, NY, USA, 2004.
8. M. B. Eisen, P. T. Spellman, P. O. Brown, and D. Botstein. Cluster analysis and display of genome-wide expression patterns. Proceedings of the National Academy of Sciences of the United States of America, 95(25): 14863-14868, 1998.
9. Brian S. Everitt, Sabine Landau, and Morven Leese. Cluster Analysis. John Wiley & Sons, Inc, third edition, 1993.
10. Nathan Gale, William C. Halperin, and C. Michael Costanzo. Unclassed matrix shading and optimal ordering in hierachical cluster analysis. Journal of Classification, 1:75-92, 1984.
11. M.R. Garey and D.S Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., 1979.
12. Alan George and Joseph W-H Liu. Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall Series in Computational Mathematics. Prentice-Hall, Inc, Englewood Cliffs, NJ, 1981.
13. Mohammad Ghoniem, Jean-Daniel Fekete, and Philippe Castagliola. On the readability of graphs using node-link and matrix-based representations: a controlled experiment and statistical analysis. Information Visualization, 4(2): 114-135, Summer 2005.
14. A. J. Gibbs and G. A. McIntyre. The diagram, a method for comparing sequences. Its use with amino acid and nucleotide sequences. Eur J Biochem, 16(1):1-11, 1970. 0014-2956 Journal Article.
15. Norman E. Gibbs, Jr. William G. Poole, and Paul K. Stockmeyer. A comparison of several bandwidth and profile reduction algorithms. ACMTrans. Math. Softw., 2(4):322-330, 1976.
16. Jonathan Helfman. Dotplot patterns: a literal look at pattern languages. Theor. Pract. Object Syst., 2(1):31-41, 1996.
17. Y F. Hu and J. A. Scott. A multilevel algorithm for wavefront reduction. SIAM Journal on Scientific Computing, 23(4): 1352-1375, 2002.
18. William T. McCormick Jr., Paul J. Schweitzer, and Thomas W. White. Problem decomposition and data reorganization by a clustering technique. Operations Research, 20(5):993-1009, Sep.-Oct. 1972.
19. George Karypis and Vipin Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. In International Conference on Parallel Processing, pages 113-122, 1995.
20. I. P. King. An automatic reordering scheme for simultaneous equations derived from network analysis. Int. j. numer, methods eng., 2:523-533, 1970.
21. Gary Kumfert and Alex Pothen. Two improved algorithms for envelope and wavefront reduction. Technical report, 1997.
22. T. Loos and R. Bramley. Emily: A visualization utility for large matrices. Technical report, Indiana University, 1994.
23. F. Marcotorchino. Sedation problems: An overview. Applied Stochastic Models and Data Analysis, 7:189-151, 1991.
24. Mathworks. Matlab. Web site. Accessed March 22, 2006.
25. Boris Mirkin. Mathematical Classification and Clustering, chapter 4.2. Kleuwer Academic Publishers, 1996.
26. Christopher Mueller. Supplementary material. Web site. http://www.osl.iu. edu/~chemuell/new/vertex-ordering.php.
27. Christopher Mueller, Benjamin Martin, and Andrew Lumsdaine. Interpreting large visual similarity matrices. Asia Pacific Symposium on Information Visualization 2007.
28. Fionn Murtagh. Multidimensional Clustering Algorithms, volume 4 of Lectures in Computational Statistics. Physica-Verlag ViennaWurzburg, 1985. Very clear and concise overview of ordering, heirarchical clustering, and minimum spanning tree clustering techniques. Called COMPSTAT LECTURES 4 in IU library stacks.
29. National Cancer Institute. NCI Aids Antiviral Screen, May 2004.
30. NCBI. Clusters of Orthologous Groups of proteins (COGs).
31. Inc Research Systems. Idl. Web site. Accessed March 22, 2006.
32. Matthew Schumaker. Matrix Visualization of Graphs. PhD thesis, Rensselaer Polytechnic Institute, 2004.
33. Jeremy Siek, Andrew Lumsdaine, and Lie-Quan Lee. Boost Graph Library. Boost, 2001. http ://www.boost.org/libs/graph/doc/index.html.
34. S. W Sloan. An algorithm for profile and wavefront reduction of sparse matrices. Int. j. numer, methods eng., 23:239-251, 1986.
35. Peter H. A. Sneath and Robert R. Sokal. Numerical Taxonomy: The Principles and Practice of Numerical Classification, chapter 5. W H. Freeman and Company, San Francisco, 1973.
36. Alexander Strehl and Joydeep Ghosh. Relationship-based clustering and visualization for high-dimensional data mining. INFORMS J. on Computing, 15(2):208-230, 2003.
37. F. van Ham. Using multilevel call matrices in large software projects. In Proc. IEEE Symp. Information Visualization 2003, pages pp.227-232. IEEE CS Press, 2003.
38. Jun Wang, Bei Yu, and Les Gasser. Classification visualization with shaded similarity matrix. Technical report, GSLIS University of Illinois at Urbana-Champaign, 2002.
39. Douglas B. West. Introduction to Graph Theory, pages 78 (BFS, DFS), 436-449 (spectral). Prentice-Hall, Inc., 1996.