Newman, MEJ,
{Finding community structure in networks using the eigenvectors of matrices}, in:
Physical Review E
74
3
(2006),
S. 36104.
Chung, F. R. K.
Spectral Graph Theory.
Monien, B.,
Rezension zu: On Spectral Bounds for the k-Partitioning of Graphs
(2001).
Mohar, B.,
{The Laplacian spectrum of graphs}, in:
Graph Theory, Combinatorics, and Applications
2
(1991),
S. 871--898.
Spielman, D.A.,
Spectral Graph Theory and its Applications, in:
Foundations of Computer Science, 2007. FOCS '07. 48th Annual IEEE Symposium on
(2007),
S. 29-38.
Johnson, David S., Papadimitriou, Christos H.,
On generating all maximal independent sets, in:
Inf. Process. Lett.
27
3
(1988),
S. 119--123.
Dias, Vânia M.F., de Figueiredo, Celina M.H., Szwarcfiter, Jayme L.,
Generating bicliques of a graph in lexicographic order, in:
Theoretical Computer Science
337
1-3
(2005),
S. 240 - 248.
Fiedler, M.,
{A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory}, in:
Czechoslovak Mathematical Journal
25
100
(1975),
S. 619--633.
Haveliwala, T.H., Kamvar, S.D.,
{The second eigenvalue of the Google matrix}, in:
A Stanford University Technical Report http://dbpubs. stanford. edu
(2003).
Dhillon, Inderjit S.:
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.
New York, NY, USA
: ACM Press,
2001. - ISBN
158113391X,
S. 269--274
Blelloch, Guy:
Graph Separators,
2002. -
Pothen, A., Simon, H.D., Liou, K.P.,
{Partitioning Sparse Matrices with Eigenvectors of Graphs}, in:
SIAM J. MATRIX ANAL. APPLIC.
11
3
(1990),
S. 430--452.
Chan, Pak K., Schlag, Martine D. F., Zien, Jason Y.,
Spectral K-way ratio-cut partitioning and clustering., in:
IEEE Trans. on CAD of Integrated Circuits and Systems
13
9
(1994),
S. 1088-1096.
Yu, Stella X., Shi, Jianbo:
Multiclass Spectral Clustering.
In: Proc. International Conference on Computer Vision (ICCV 03).
Nice, France,
2003
Hagen, Lars W., Kahng, Andrew B.,
New spectral methods for ratio cut partitioning and clustering., in:
IEEE Trans. on CAD of Integrated Circuits and Systems
11
9
(1992),
S. 1074-1085.
Symeonidis, Panagiotis, Nanopoulos, Alexandros, Manolopoulos, Yannis:
Tag recommendations based on tensor dimensionality reduction.
In: RecSys '08: Proceedings of the 2008 ACM conference on Recommender systems.
New York, NY, USA
: ACM,
2008. - ISBN
978-1-60558-093-7,
S. 43--50
Ranade, A.G.:
{Some uses of spectral methods},
2000. -
Schmitz, Christoph, Hotho, Andreas, Jäschke, Robert, Stumme, Gerd
; Sure, York, Domingue, John:
Content Aggregation on Knowledge Bases using Graph Clustering.
4011.
In: The Semantic Web: Research and Applications.
Heidelberg
: Springer,
2006
(LNAI),
S. 530-544
Brandes, Ulrik, Delling, Daniel, Gaertler, Marco, Görke, Robert, Hoefer, Martin, Nikoloski, Zoran, Wagner, Dorothea,
On Finding Graph Clusterings with Maximum Modularity, in:
Brandstädt, Andreas, Kratsch, Dieter, Müller, Haiko (Hrsg.), Graph-Theoretic Concepts in Computer Science,
Bd. 4769, Berlin / Heidelberg 2007,
S. 121-132.
Diestel, Reinhard
Graph Theory,
3 (electronic edition). Aufl..