Newman, M. (2006),
'Finding community structure in networks using the eigenvectors of matrices', Physical Review E
74
(3)
, 36104
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Chung, F. R. K.
(1997),
Spectral Graph Theory
, American Mathematical Society
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Monien, B. (2001),
'On Spectral Bounds for the k-Partitioning of Graphs'
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Mohar, B. (1991),
'The Laplacian spectrum of graphs', Graph Theory, Combinatorics, and Applications
2
, 871--898
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Spielman, D. (2007),
'Spectral Graph Theory and its Applications', Foundations of Computer Science, 2007. FOCS '07. 48th Annual IEEE Symposium on
, 29-38
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Johnson, D. S. & Papadimitriou, C. H. (1988),
'On generating all maximal independent sets', Inf. Process. Lett.
27
(3)
, 119--123
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Dias, V. M.; de Figueiredo, C. M. & Szwarcfiter, J. L. (2005),
'Generating bicliques of a graph in lexicographic order', Theoretical Computer Science
337
(1-3)
, 240 - 248
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Fiedler, M. (1975),
'A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory', Czechoslovak Mathematical Journal
25
(100)
, 619--633
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Haveliwala, T. & Kamvar, S. (2003),
'The second eigenvalue of the Google matrix', A Stanford University Technical Report http://dbpubs. stanford. edu
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Dhillon, I. S. (2001),
Co-clustering documents and words using bipartite spectral graph partitioning, in
'KDD '01: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining'
, ACM Press, New York, NY, USA
, pp. 269--274
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Blelloch, G. (2002),
'Graph Separators'
.
[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]
Chan, P. K.; Schlag, M. D. F. & Zien, J. Y. (1994),
'Spectral K-way ratio-cut partitioning and clustering.', IEEE Trans. on CAD of Integrated Circuits and Systems
13
(9)
, 1088-1096
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Yu, S. X. & Shi, J. (2003),
Multiclass Spectral Clustering, in
'Proc. International Conference on Computer Vision (ICCV 03)'
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Hagen, L. W. & Kahng, A. B. (1992),
'New spectral methods for ratio cut partitioning and clustering.', IEEE Trans. on CAD of Integrated Circuits and Systems
11
(9)
, 1074-1085
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Symeonidis, P.; Nanopoulos, A. & Manolopoulos, Y. (2008),
Tag recommendations based on tensor dimensionality reduction, in
'RecSys '08: Proceedings of the 2008 ACM conference on Recommender systems'
, ACM, New York, NY, USA
, pp. 43--50
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]
Ranade, A. (2000),
'Some uses of spectral methods'
.
[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]
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]
Diestel, R.
(2005),
Graph Theory
, Springer-Verlag Heidelberg, New York
.
[Volltext]
[Kurzfassung]
[BibTeX]
[Endnote]