References

[BH86]

Josh Barnes and Piet Hut. A hierarchical O(N log N) force-calculation algorithm. Nature, 324:446–449, 1986.

[BN05a]

Dirk Beyer and Andreas Noack. Clustering software artifacts based on frequent common changes. In Proc. IWPC, pages 259–268. IEEE, 2005.

[BN05b]

Dirk Beyer and Andreas Noack. Mining co-change clusters from version repositories. Technical Report IC/2005/003, EPFL Lausanne, 2005.

[EW93]

Stephen G. Eick and Graham J. Wills. Navigating large networks with hierarchies. In Proc. Visualization, pages 204–210, 1993.

[FR91]

Thomas M. J. Fruchterman and Edward M. Reingold. Graph drawing by force-directed placement. Software – Practice and Experience, 21(11):1129–1164, 1991.

[MMCG99]

S. Mancoridis, B. S. Mitchell, Y. Chen, and E. R. Gansner. Bunch: A clustering tool for the recovery and maintenance of software system structures. In Proc. ICSM, pages 50–59. IEEE, 1999.

[MNGL98]

G. C. Murphy, D. Notkin, W. G. Griswold, and E. S. Lan. An empirical study of static call-graph extractors. ACM Trans. Softw. Eng. Methodol., 7(2):158–191, 1998.

[Noa04a]

Andreas Noack. An energy model for visual graph clustering. In Proc. GD’03, LNCS 2912, pages 425–436. Springer, 2004.

[Noa04b]

Andreas Noack. Visual clustering of graphs with nonuniform degrees. Technical Report 02/04, BTU Cottbus, 2004.

[ZDZ03]

Thomas Zimmermann, Stephan Diehl, and Andreas Zeller. How history justifies system architecture (or not). In Proc. IWPSE, pages 73–83. IEEE, 2003.

© Dirk Beyer

---