Energy-based clustering of graphs with nonuniform degrees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3843 LNCS, Issue , 2006, Pages 309-320

  Noack, Andreas ^a  

^a BRANDENBURG UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; COMPUTER SOFTWARE; COMPUTER SUPPORTED COOPERATIVE WORK; DATABASE SYSTEMS; MATHEMATICAL MODELS; SEMANTICS;

EDGE NUMBERS; ENERGY MODELS; HYPERLINK STRUCTURES; SOCIAL NETWORKS;

GRAPH THEORY;

EID: 33745649390     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11618058_28     Document Type: Conference Paper

References (22)

1. Réka Albert and Albert-László Barabási. Statistical mechanics of complex networks. Reviews of Modern Physics, 74(1):47-97, 2002.
2. Charles J. Alpert and Andrew B. Kahng. Recent directions in nellist partitioning: A survey. Integration, the VLSI Journal, 19(1-2):1-81, 1995.
3. Josh Barnes and Piet Hut. A hierarchical O(N log N) force-calculation algorithm. Nature, 324:446-449, 1986.
4. Jim Blythe, Cathleen McGrath, and David Krackhardt. The effect of graph layout on inference from social network data. In Proc. GD 1995, pages 40-51. Springer-Verlag, 1996.
5. Ron Davidson and David Harel. Drawing graphs nicely using simulated annealing. ACM Transactions on Graphics, 15(4):301-331, 1996.
6. Edmund Dengler and William Cowan. Human perception of laid-out graphs. In Proc. GD 1998, pages 441-443. Springer-Verlag, 1998.
7. Peter Eades. A heuristic for graph drawing. Congressus Numerantium, 42:149-160, 1984.
8. Thomas M. J. Fruchterman and Edward M. Reingold. Graph drawing by force-directed placement. Software - Practice and Experience, 21(11):1129-1164, 1991.
9. Pawel Gajer, Michael T. Goodrich, and Stephen G. Kobourov. A multi-dimensional approach to force-directed layouts of large graphs. In Proc. GD 2000, pages 211-221. Springer-Verlag, 2001.
10. Stefan Hachul and Michael Jünger. Drawing large graphs with a potential-field-based multi-level algorithm. In Proc. GD 2004, pages 285-295. Springer-Verlag, 2004.
11. Kenneth M. Hall. An r-dimensional quadratic placement algorithm. Management Science, 17(3):219-229, 1970.
12. David Harel and Yehuda Korea A fast multi-scale method for drawing large graphs. In Proc. GD 2000, pages 183-196. Springer-Verlag, 2001.
13. Tomihisa Kamada and Satoru Kawai. An algorithm for drawing general undirected graphs. Information Processing Letters, 31(1):7-15, 1989.
14. Ravi Kannan, Santosh Vempala, and Adrian Vetta. On clusterings: Good, bad and spectral. Journal of the ACM, 51 (3):497-515, 2004.
15. Tom Leighton and Satish Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In Proc. 29th Annual Symposium on Foundations of Computer Science (FOCS 1988), pages 422-431. IEEE, 1988.
16. 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 Proc. 6th IEEE International Workshop on Program Comprehension (IWPC 1998), pages 45-52. IEEE, 1998.
17. Andreas Noack. An energy model for visual graph clustering. In Proc. GD 2003, pages 425-436. Springer-Verlag, 2004.
18. Andreas Noack and Claus Lewerentz. A space of layout styles for hierarchical graph models of software systems. In Proc. 2nd ACM Symposium on Software Visualization (SoftVis 2005), pages 155-164. ACM, 2005.
19. Aaron J. Quigley and Peter Eades. FADE: Graph drawing, clustering, and visual abstraction. In Proc. GD 2000, pages 197-210. Springer-Verlag, 2001.
20. Jianbo Shi and Jitendra Malik. Normalized cuts and image segmentation. IEEE Transaction on Pattern Analysis and Machine Intelligence, 22(8):888-905, 2000.
21. Chris Walshaw. A multilevel algorithm for force-directed graph drawing. In Proc. GD 2000, pages 171-182. Springer-Verlag, 2001.
22. Zhenyu Wu and Richard Leahy. An optimal graph theoretic approach to data clustering: Theory and its application to image segmentation. IEEE Transaction on Pattern Analysis and Machine Intelligence, 15(11):1101-1113, 1993.