A space efficient clustered visualization of large graphs

Proceedings of the 4th International Conference on Image and Graphics, ICIG 2007

Volumn , Issue , 2007, Pages 920-927

  Mao, Lin Huang ^a   Quang, Vinh Nguyen ^a  

^a UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ANIMATION; BOOLEAN FUNCTIONS; CANNING; COLOR IMAGE PROCESSING; DRAWING (GRAPHICS); EDGE DETECTION; FLOW INTERACTIONS; GRAPHIC METHODS; MAPS; OPTIMIZATION; PHOTOCOPYING;

COMMUNITY STRUCTURES; GRAPH BASED; GRAPH DRAWING; INTERACTION MECHANISMS; INTERNATIONAL CONFERENCES; LARGE GRAPHS; MENTAL MAPS; MULTIPLE CLUSTERS; PARTITIONING ALGORITHMS;

GRAPH THEORY;

EID: 47349085594     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIG.2007.10     Document Type: Conference Paper

References (22)

1. J. Abello, F. van Ham, and N. Krishnan. Ask-graphview: A large scale graph visualization system. IEEE Transactions on Visualization and Computer Graphics, 12(5), 2006.
2. D. Archambault, T. Munzner, and D. Auber. Topolayout: Multi-level graph layout by topological features. IEEE Transactions on Visualization and Computer Graphics, 12, 2006.
3. D. Auber. Tulip: A huge graph visualisation framework. In Proc. Graph Drawing Software, Mathematics and Visualization, pages 105-126, 2003.
4. D. Auber, Y. Chiricota, F. Jourdan, and G. Malancon. Multiscale visualization of small world networks. In Proc. IEEE Symposium on Information Visualization, pages 75-81, 2003.
5. D. Auber and F. Jourdan. Interactive refinement of multiscale network clusterings. In Proc. IV 2005, pages 703-709, 2005.
6. P. Eades. A heuristic for graph drawing. Congressus Numerantium, 42:149-160, 1984.
7. P. Eades and Q. Feng. Multilevel visualization of clustered graphs. In Proc. Graph Drawing (GD'96), pages 101-112, 1996.
8. J.-D. Fekete, D. Wang, N. Dang, A. Aris, and C. Plaisant. Overlaying graph links on treemaps. In Proc. Information Visualization 2003 Symposium Poster Compendium, pages 82-83, 2003.
9. Q. Feng. Algorithms for Drawing Clustered Graphs. PhD Thesis, The University of Newcastle, 1997.
10. S. Hachul and M. Junger. An experimental comparison of fast algorithms for drawing general large graphs. In Proc. Graph Drawing (GD'05), pages 235-250, 2005.
11. D. Harel and Y. Koren. A fast multi-scale method for drawing large graphs. In Proc. Graph Drawing (GD'00), pages 183-196, 2000.
12. D. Harel and Y. Koren. Graph drawing by high-dimensional embedding. Journal of Graph Algorithms and Applications, 8(2):195-214, 2004.
13. I. Herman, G. Melancon, and M. S. Marshall. Graph visualization in information visualization: a survey. IEEE Transactions on Visualization and Computer Graphics, 6:24-44, 2000.
14. B. Johnson and B. Shneiderman. Tree-maps: A space-filling approach to the visualization of hierarchical information structures. In Proc. 1991 IEEE Visualization, pages 284-291, 1991.
15. S. Marshall. Methods and tools for the visualization and navigation of graphs. PhD Thesis, University Bordeaux I, 2001.
16. M. E. J. Newman. Fast algorithm for detecting community structure in networks. Physical Review E, 69:066133, 2004.
17. Q. V. Nguyen and M. L. Huang. Space-optimized tree: a connection+enclosure approach for the visualization of large hierarchies. Information Visualization Journal, 2(1):3-15, 2003.
18. Q. V. Nguyen and M. L. Huang. Enccon: An approach to constructing interactive visualization of large hierarchical data. Information Visualization Journal, 4(1):1-21, 2005.
19. J. C. Robert. On encouraging multiple views for visualisation. In Proc. International Conference on Information Visualisation (IV 1998), pages 8-14, 1998.
20. C. Walshaw. A multilevel algorithm for force-directed graph drawing. In Mathematics Research Report 00/IM/60, University of Greenwich, pages 1-22, 2000.
21. C. Ware. Information Visualization: Perception for Design. Morgan Kaufmann, 2004.
22. A. J. Wilkins. Visual Stress. Oxford University Press, 1995.