2007

On Finding Graph Clusterings with Maximum Modularity.
In: A. Brandstädt, D. Kratsch and H. Müller, editors, Graph-Theoretic Concepts in Computer Science, pages 121-132. Springer, Berlin / Heidelberg, 2007.
Ulrik Brandes, Daniel Delling, Marco Gaertler, Robert Görke, Martin Hoefer, Zoran Nikoloski and Dorothea Wagner.
[doi]  [abstract]  [BibTeX] 

2006

Content Aggregation on Knowledge Bases using Graph Clustering.
In: Y. Sure and J. Domingue, editors, The Semantic Web: Research and Applications, volume 4011, series LNAI, pages 530-544. Springer, Heidelberg, 2006.
Christoph Schmitz, Andreas Hotho, Robert Jäschke and Gerd Stumme.
[doi]  [abstract]  [BibTeX] 
Content Aggregation on Knowledge Bases using Graph Clustering.
In: Proceedings of the 3rd European Semantic Web Conference, volume 4011, series LNCS, pages 530-544. Springer, Budva, Montenegro, 2006.
Christoph Schmitz, Andreas Hotho, Robert Jäschke and Gerd Stumme.
[doi]  [BibTeX] 
Content Aggregation on Knowledge Bases using Graph Clustering.
In: Y. Sure and J. Domingue, editors, The Semantic Web: Research and Applications, volume 4011, series LNAI, pages 530-544. Springer, Heidelberg, 2006.
Christoph Schmitz, Andreas Hotho, Robert Jäschke and Gerd Stumme.
[doi]  [abstract]  [BibTeX] 

2003

Information-Theoretic Co-Clustering.
In: Proceedings of The Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining(KDD-2003), pages 89-98. 2003.
I. S. Dhillon, S. Mallela and D. S. Modha.
[doi]  [BibTeX] 
The structure and function of complex networks.
2003.
M. E. J. Newman.
[doi]  [abstract]  [BibTeX] 

2001

On spectral clustering: Analysis and an algorithm.
In: Advances in Neural Information Processing Systems 14, pages 849-856. MIT Press, 2001.
Andrew Y. Ng, Michael I. Jordan and Yair Weiss.
[abstract]  [BibTeX] 

2000

Some uses of spectral methods.
2000.
A.G. Ranade.
[BibTeX] 

1996

Spectral Partitioning Works: Planar Graphs and Finite Element Meshes.
1996.
Daniel A. Spielman and Shang Teng.
[BibTeX] 

1990

Partitioning Sparse Matrices with Eigenvectors of Graphs.
SIAM J. MATRIX ANAL. APPLIC., 11(3):430-452, 1990.
A. Pothen, H.D. Simon and K.P. Liou.
[doi]  [BibTeX] 

1973

Lower bounds for the partitioning of graphs.
IBM Journal of Research and Development, 17(5):420-425, 1973.
W.E. Donath and A.J. Hoffman.
[BibTeX]