A fast algorithm for balanced graph clustering

Proceedings of the International Conference on Information Visualisation

Volumn , Issue , 2007, Pages 46-52

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

^a UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

Author keywords

Clustered graph; Graph drawing; Information visualization

Indexed keywords

CLUSTERED GRAPH; GRAPH DRAWING; INFORMATION VISUALIZATION;

ABSTRACTING; CLUSTER ANALYSIS; GRAPH THEORY; HIERARCHICAL SYSTEMS; PROBLEM SOLVING;

ALGORITHMS;

EID: 35348853959     PISSN: 10939547     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IV.2007.10     Document Type: Conference Paper

References (22)

1. Herman, I., Melancon, G. and Marshall, M.S. Graph visualization in information visualization: a survey. IEEE Transactions on Visualization and Computer Graphics, 6: 24-44, 2000.
2. Eades, P. and Feng, Q. Multilevel visualization of clustered graphs. In Graph Drawing (GD'96), Springer, pages 101-112, 1996.
3. Eades, P. and Huang, M. L. Navigating clustered graphs using force-directed methods. Journal of Computational and Graphical Statistics, 4(3): 157-181, 2000.
4. Sugiyama, K. and Misue, K. Visualization of structural information: Automatic drawing of compound digraphs. IEEE Transactions on Systems, Man, and Cybernetics, 21(4): 867-892, 1991.
5. Elsner, U. Graph partitioning: a survey. Technische Universitat Chemnitz, December 1997.
6. Pothen, A. Graph partitioning algorithms with applications to scientific computing. In Parallel Numerical Algorithms, Kluwer, pages 323-368, 1997.
7. Miller, G. L., Teng, S. H., Thurston, W. and Vavasis, S. A. Geometric separators for finite element meshes. SIAM Journal on Scientific Computing, 19(2): 364-386, march 1998.
8. Kernighan, G. and Lin, S. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 29(2): 291-307, 1970.
9. Chartrand, G. and Oellermann, O. R. Applied and Algorithmic Graph Theory. International series in pure and applied mathematics. McGraw-Hill, New York, 1993.
10. Golub, G. H. and Loan, C. F., Matrix Computations. Johns Hopkins University Press, Baltimore and London, 3rd edition, 1996.
11. Hendrickson, B. and Leland, R. An improved spectral graph partitioning algorithm for mapping parallel computations. SIAM Journal on Scientific Computing, 16(2): 452-469, 1995
12. Barnard, S. T. PMRSB: Parallel multilevel recursive spectral bisection. In the 1995 ACM/IEEE Supercomputing Conference. ACM / IEEE, 1995, CD-ROM.
13. Hendrickson, B. and Leland, R. A multilevel algorithm for partitioning graphs. In Supercomputing '95, ACM Press, 1995, CD-ROM.
14. Karypis, G. and Kumar, V. Multilevel algorithms for multi-constraint graph partitioning. In Supercomputing '98, ACM SIGARCH and IEEE, 1998, CD-ROM.
15. Delest, M., Fedou, J. M., and Melancon, G. A quality measure for multi-level community structure. In SYNASC 8th Internatinal Conference, 2006.
16. Mancoridis, S., Mitchell, B. S., Chen, Y. and Gansner, E. R. Bunch: a clustering tool for the recovery and maintenance of software system structures. In IEEE Int'l Conf. Software Maintenance, pages. 50-59, 1999.
17. Newman, M. E. J. and Girvan, M. Finding and evaluating community structure in networks. Physical Review E, 69, 2004, 026113.
18. Newman, M. E. J. Fast algorithm for detecting community structure in networks. Physical Review E, 69, 2004, 066133.
19. Di Battista G, Eades P, Tamassia R, and Tollis IG. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall: New Jersey, 1999; 397pp.
20. Ware, C., Purchase, H., Colpoys, L. and McGill, M. Cognitive measurements of graph aesthetics. Information Visualization, Palgrave, 1(2): 103-110, 2002.
21. Duncan, C. A., Goodrich, M. T. and Kobourov, S. G. Balanced aspect ratio trees and their use for drawing large graphs. Journal of Graph Algorithms and Applications, 4(3), pp. 19-46, 2000
22. Nguyen, Q. V. and Huang, M. L. EncCon: an approach to constructing interactive visualization of large hierarchical data. Information Visualization Journal, Palgrave, 4(1): 1-21, 2005.