SuperGraph visualization

ISM 2006 - 8th IEEE International Symposium on Multimedia

Volumn , Issue , 2006, Pages 227-234

  Rodrigues Jr , José F ^a   Traina, Agma J M ^a   Faloutsos, Christos ^b   Traina Jr , Caetano ^a  

^a UNIVERSITY OF SÃO PAULO   (Brazil)

^b Carnegie Mellon University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; PARTITIONS (BUILDING); TECHNICAL PRESENTATIONS; VISUALIZATION;

GRAPH VISUALIZATION; INTERACTIVE ENVIRONMENTS; INTERACTIVE VISUALIZATIONS; INTERNATIONAL SYMPOSIUM; LARGE GRAPHS; PROCESSING POWER;

GRAPH THEORY;

EID: 46249123232     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISM.2006.143     Document Type: Conference Paper

References (9)

1. E. Dahlhaus, J. Gustedt, and R. M. McConnell. Efficient and practical algorithms for sequential modular decomposition. Journal of Algorithms, 41:360-387, 2001.
2. Peter Eades. Drawing clustered graphs on an orthogonal grid. Journal of Graph Algorithms and Applications, 3(4):3-29, 1999.
3. Peter Eades and Qing-Wen Feng. Multilevel visualization of clustered graphs. In Graph Drawing 1996, LNCS 1190, pages 101-112. Springer-Verlag.
4. Yaniv Frishman and Ayellet Tal. Dynamic drawing of clustered graphs. In Infovis 2004, pages 191-198.
5. George Karypis and Vipin Kumar. Multilevel graph partitioning schemes. In IEEE/ACM Int. Conference on Parallel Processing 1995, pages 113-122.
6. T. Munzner. Exploring large graphs in 3d hyperbolic space. IEEE Computer Graphics and Applications, 18(4):18-23, 1998.
7. C. Papadopoulos and C. Voglis. Drawing graphs using modular decomposition. In Graph Drawing 2005, LNCS 3843, pages 343-354. Springer-Verlag.
8. D. Schaffer, Z. Zuo, S. Greenberg, L. Bartram, J. Dill, S. Dubs, and M. Roseman. Navigating hierarchically clustered networks through fisheye and full-zoom methods. ACM Transactions on Computer-Human Interaction, 3(2):162-188, 1996.
9. C. Walshaw and M. Cross. Mesh partitioning: a multi-level balancing and refinement algorithm. SIAM J. Sci. Comput., 22(1):63-80, 2000.