Brandes, U.; Delling, D.; Gaertler, M.; Görke, R.; Hoefer, M.; Nikoloski, Z. & Wagner, D. (2007),
On Finding Graph Clusterings with Maximum Modularity, *in Andreas Brandstädt; Dieter Kratsch & Haiko Müller*, ed.,
'Graph-Theoretic Concepts in Computer Science'
, Springer, Berlin / Heidelberg
, pp. 121-132
.

[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]

Schmitz, C.; Hotho, A.; Jäschke, R. & Stumme, G. (2006),
Content Aggregation on Knowledge Bases using Graph Clustering, *in*
York Sure & John Domingue, ed.,
'The Semantic Web: Research and Applications'
, Springer, Heidelberg
, pp. 530-544
.

[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]

Schmitz, C.; Hotho, A.; Jäschke, R. & Stumme, G. (2006),
Content Aggregation on Knowledge Bases using Graph Clustering, *in*
'Proceedings of the 3rd European Semantic Web Conference'
, Springer, Budva, Montenegro
, pp. 530-544
.

[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]

Schmitz, C.; Hotho, A.; Jäschke, R. & Stumme, G. (2006),
Content Aggregation on Knowledge Bases using Graph Clustering, *in*
York Sure & John Domingue, ed.,
'The Semantic Web: Research and Applications'
, Springer, Heidelberg
, pp. 530-544
.

[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]

Dhillon, I. S.; Mallela, S. & Modha, D. S. (2003),
Information-Theoretic Co-Clustering, *in*
'Proceedings of The Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining(KDD-2003)'
, pp. 89--98
.

[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]

Newman, M. E. J. (2003),
'The structure and function of complex networks'
.

[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]

Ng, A. Y.; Jordan, M. I. & Weiss, Y. (2001),
On spectral clustering: Analysis and an algorithm, *in*
'Advances in Neural Information Processing Systems 14'
, MIT Press,
, pp. 849--856
.

[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]

Ranade, A. (2000),
'Some uses of spectral methods'
.

[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]

Spielman, D. A. & Teng, S. (1996),
'Spectral Partitioning Works: Planar Graphs and Finite Element Meshes'
, University of California at Berkeley
, Berkeley, CA, USA
.

[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]

Pothen, A.; Simon, H. & Liou, K. (1990),
'Partitioning Sparse Matrices with Eigenvectors of Graphs', * SIAM J. MATRIX ANAL. APPLIC.*
**11**
(3)
, 430--452
.

[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]

Donath, W. & Hoffman, A. (1973),
'Lower bounds for the partitioning of graphs', * IBM Journal of Research and Development*
**17**
(5)
, 420--425
.

[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]