Energy models for graph clustering

Journal of Graph Algorithms and Applications

Volumn 11, Issue 2, 2007, Pages 453-480

  Noack, Andreas ^a  

^a BRANDENBURG UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; SOCIAL SCIENCES COMPUTING;

CLUSTER STRUCTURE; ENERGY MODEL; EXISTING ENERGIES; GRAPH CLUSTERING; MINIMUM ENERGY; QUALITY CRITERIA; REAL-WORLD GRAPHS; SKEWED DEGREE DISTRIBUTION; SOFTWARE-SYSTEMS; STRUCTURE OF GRAPH;

DRAWING (GRAPHICS);

EID: 60949113171     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00154     Document Type: Article

References (51)

1. R. Albert and A.-L. Barabási. Statistical mechanics of complex networks. Reviews of Modern Physics, 74(1):47-97, 2002.
2. C. J. Alpert and A. B. Kahng. Recent directions in netlist partitioning: A survey. Integration, the VLSI Journal, 19(1-2):1-81, 1995.
3. S. Arora, S. Rao, and U. V. Vazirani. Expander ows, geometric embeddings and graph partitioning. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC 2004), pages 222-231. ACM, 2004.
4. Y. Aumann and Y. Rabani. An O(log k) approximate min-cut max-ow theorem and approximation algorithm. SIAM Journal on Computing, 27(1):291-301, 1998.
5. J. Barnes and P. Hut. A hierarchical O(N logN) force-calculation algorithm. Nature, 324:446-449, 1986.
6. F. Bertault. A force-directed algorithm that preserves edge crossing properties. In J. Kratochvíl, editor, Proceedings of the 7th International Sym-posium on Graph Drawing (GD 1999), LNCS 1731, pages 351-358, Berlin, 1999. Springer-Verlag.
7. D. Beyer and A. Noack. Clustering software artifacts based on frequent common changes. In Proceedings of the 13th International Workshop on Program Comprehension (IWPC 2005), pages 259-268. IEEE Computer Society, 2005.
8. J. Blythe, C. McGrath, and D. Krackhardt. The eéct of graph layout on inference from social network data. In F.-J. Brandenburg, editor, Proceed-ings of the Symposium on Graph Drawing (GD 1995), LNCS 1027, pages 40-51, Berlin, 1996. Springer-Verlag.
9. F.-J. Brandenburg, M. Himsolt, and C. Rohrer. An experimental comparison of force-directed and randomized graph drawing algorithms. In F.-J. Brandenburg, editor, Proceedings of the Symposium on Graph Drawing (GD 1995), LNCS 1027, pages 76-87, Berlin, 1996. Springer-Verlag.
10. F. R. K. Chung. Spectral Graph Theory. American Mathematical Society, Providence, RI, 1997.
11. M. K. Coleman and D. S. Parker. Aesthetics-based graph layout for human consumption. Software-Practice & Experience, 26(12):1415-1438, 1996.
12. I. F. Cruz and J. P. Twarog. 3D graph drawing with simulated annealing. In F.-J. Brandenburg, editor, Proceedings of the Symposium on Graph Drawing (GD 1995), LNCS 1027, pages 162-165, Berlin, 1996. Springer-Verlag.
13. R. Davidson and D. Harel. Drawing graphs nicely using simulated annealing. ACM Transactions on Graphics, 15(4):301-331, 1996.
14. E. Dengler and W. Cowan. Human perception of laid-out graphs. In S. H. Whitesides, editor, Proceedings of the 6th International Symposium on Graph Drawing (GD 1998), LNCS 1547, pages 441-443, Berlin, 1998. Springer-Verlag.
15. W. E. Donath and A. J. Hoffman. Lower bounds for the partitioning of graphs. IBM Journal of Research and Development, 17:420-425, 1973.
16. P. Eades. A heuristic for graph drawing. Congressus Numerantium, 42:149-160, 1984.
17. M. Fiedler. A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czechoslovak Mathematical Journal, 25(100):619-633, 1975.
18. L. C. Freeman. Finding social groups: A meta-analysis of the southern women data. In R. Breiger, K. Carley, and P. Pattison, editors, Dy-namic Social Network Modeling and Analysis, pages 37-77. The National Academies Press, Washington, DC, 2003.
19. A. Frick, A. Ludwig, and H. Mehldau. A fast adaptive layout algorithm for undirected graphs. In R. Tamassia and I. G. Tollis, editors, Proceedings of the DIMACS International Workshop on Graph Drawing (GD 1994), LNCS 894, pages 388-403, Berlin, 1995. Springer-Verlag.
20. T. M. J. Fruchterman and E. M. Reingold. Graph drawing by force-directed placement. Software-Practice and Experience, 21(11):1129-1164, 1991.
21. P. Gajer, M. T. Goodrich, and S. G. Kobourov. A multi-dimensional approach to force-directed layouts of large graphs. Computational Geometry, 29(1):3-18, 2004.
22. E. R. Gansner, Y. Koren, and S. North. Graph drawing by stress majorization. In J. Pach, editor, Proceedings of the 12th International Symposium on Graph Drawing (GD 2004), LNCS 3383, pages 239-250, Berlin, 2005. Springer-Verlag.
23. R. E. Gomory and T. C. Hu. Multi-terminal network ows. Journal of SIAM, 9(4):551-570, 1961.
24. S. Hachul and M. Jünger. Drawing large graphs with a potential-éldbased multilevel algorithm. In J. Pach, editor, Proceedings of the 12th International Symposium on Graph Drawing (GD 2004), LNCS 3383, pages 285-295, Berlin, 2004. Springer-Verlag.
25. S. Hachul and M. Jünger. An experimental comparison of fast algorithms for drawing general large graphs. In P. Healy and N. S. Nikolov, editors, Proceedings of the 13th International Symposium on Graph Drawing (GD 2005), LNCS 3843, pages 235-250, Berlin, 2006. Springer-Verlag.
26. K. M. Hall. An r-dimensional quadratic placement algorithm. Management Science, 17(3):219-229, 1970.
27. D. Harel and Y. Koren. A fast multi-scale method for drawing large graphs. Journal of Graph Algorithms and Applications, 6(3):179-202, 2002.
28. A. K. Jain and R. C. Dubes. Algorithms for Clustering Data. Prentice Hall, Englewood Cliš, NJ, 1988.
29. V. Kaibel. On the expansion of graphs of 0/1-polytopes. In M. Grötschel, editor, The Sharpest Cut: The Impact of Manfred Padberg and His Work, pages 199-216. SIAM, 2004.
30. T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Information Processing Letters, 31(1):7-15, 1989.
31. R. Kannan, S. Vempala, and A. Vetta. On clusterings: Good, bad and spectral. Journal of the ACM, 51(3):497-515, 2004.
32. Y. Koren. Drawing graphs by eigenvectors: Theory and practice. Comput-ers and Mathematics with Applications, 49(11-12):1867-1888, 2005.
33. T. Leighton and S. Rao. An approximate max-ow min-cut theorem for uniform multicommodity ow problems with applications to approximation algorithms. In Proceedings of the 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), pages 422-431. IEEE Computer Society, 1988.
34. T. Leighton and S. Rao. Multicommodity max-ow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM, 46(6):787-832, 1999.
35. C.-C. Lin and H.-C. Yen. A new force-directed graph drawing method based on edge-edge repulsion. In Proceedings of the 9th International Conference on Information Visualisation (IV 2005), pages 329-334. IEEE Computer Society, 2005.
36. N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2):215-245, 1995.
37. S. Mancoridis, B. S. Mitchell, C. Rorres, Y. Chen, and E. R. Gansner. Using automatic clustering to produce high-level system organizations of source code. In Proceedings of the 6th IEEE International Workshop on Program Comprehension (IWPC 1998), pages 45-52. IEEE Computer Society, 1998.
38. D. W. Matula and F. Shahrokhi. Sparsest cuts and bottlenecks in graphs. Discrete Applied Mathematics, 27(1-2):113-123, 1990.
39. M. E. J. Newman. The structure and function of complex networks. SIAM Review, 45(2):167-256, 2003.
40. M. E. J. Newman. Analysis of weighted networks. Physical Review E, 70:056131, 2004.
41. M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical Review E, 69:026113, 2004.
42. A. Noack. An energy model for visual graph clustering. In G. Liotta, editor, Proceedings of the 11th International Symposium on Graph Drawing (GD 2003), LNCS 2912, pages 425-436, Berlin, 2004. Springer-Verlag.
43. A. Noack and C. Lewerentz. A space of layout styles for hierarchical graph models of software systems. In Proceedings of the 2nd ACM Symposium on Software Visualization (SoftVis 2005), pages 155-164. ACM, 2005.
44. A. J. Quigley and P. Eades. FADE: Graph drawing, clustering, and visual abstraction. In J. Marks, editor, Proceedings of the 8th International Sym-posium on Graph Drawing (GD 2000), LNCS 1984, pages 197-210, Berlin, 2001. Springer-Verlag.
45. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Transaction on Pattern Analysis and Machine Intelligence, 22(8):888-905, 2000.
46. J. Síma and S. E. Schaeér. On the NP-completeness of some graph cluster measures. In Proceedings of the 32nd Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2006), LNCS 3831, pages 530-537, Berlin, 2006. Springer-Verlag.
47. H. A. Simon. The architecture of complexity. Proceedings of the American Philosophical Society, 106(6):467-482, 1962.
48. S. H. Strogatz. Exploring complex networks. Nature, 410:268-276, 2001.
49. K. Sugiyama and K. Misue. Graph drawing by the magnetic spring model. Journal of Visual Languages and Computing, 6(3):217-231, 1995.
50. D. Tunkelang. JIGGLE: Java interactive graph layout environment. In S. H. Whitesides, editor, Proceedings of the 6th International Symposium on Graph Drawing (GD 1998), LNCS 1547, pages 413-422, Berlin, 1998. Springer-Verlag.
51. C. Walshaw. A multilevel algorithm for force-directed graph-drawing. Jour-nal of Graph Algorithms and Applications, 7(3):253-285, 2003.