Article (newman2006fcs)
Newman, M.
Finding community structure in networks using the eigenvectors of matrices
Physical Review E,
APS,
2006, 74, 36104
Book (Chung:1997)
Chung, F. R. K.
Spectral Graph Theory
American Mathematical Society,
1997
Misc (Monien_onspectral)
Monien, B.
On Spectral Bounds for the k-Partitioning of Graphs
2001
Article (mohar1991lsg)
Mohar, B.
The Laplacian spectrum of graphs
Graph Theory, Combinatorics, and Applications,
New York: Wiley,
1991, 2, 871-898
Article (4389477)
Spielman, D.
Spectral Graph Theory and its Applications
Foundations of Computer Science, 2007. FOCS '07. 48th Annual IEEE Symposium on,
2007, 29-38
Article (46243)
Johnson, D. S. & Papadimitriou, C. H.
On generating all maximal independent sets
Inf. Process. Lett.,
Elsevier North-Holland, Inc.,
1988, 27, 119-123
Article (Dias2005240)
Dias, V. M.; de Figueiredo, C. M. & Szwarcfiter, J. L.
Generating bicliques of a graph in lexicographic order
Theoretical Computer Science,
2005, 337, 240 - 248
Article (fiedler1975pen)
Fiedler, M.
A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory
Czechoslovak Mathematical Journal,
1975, 25, 619-633
Article (haveliwala8090seg)
Haveliwala, T. & Kamvar, S.
The second eigenvalue of the Google matrix
A Stanford University Technical Report http://dbpubs. stanford. edu,
2003
Inproceedings (coclustering01)
Dhillon, I. S.
Co-clustering documents and words using bipartite spectral graph partitioning
ACM Press,
2001, 269-274
Unpublished (graphseparators02)
Blelloch, G.
Graph Separators
2002
Article (partitioning89)
Pothen, A.; Simon, H. & Liou, K.
Partitioning Sparse Matrices with Eigenvectors of Graphs
SIAM J. MATRIX ANAL. APPLIC.,
1990, 11, 430-452
Article (journals/tcad/ChanSZ94)
Chan, P. K.; Schlag, M. D. F. & Zien, J. Y.
Spectral K-way ratio-cut partitioning and clustering.
IEEE Trans. on CAD of Integrated Circuits and Systems,
1994, 13, 1088-1096
Inproceedings (yu2003multiclass)
Yu, S. X. & Shi, J.
Multiclass Spectral Clustering
2003
Article (journals/tcad/HagenK92)
Hagen, L. W. & Kahng, A. B.
New spectral methods for ratio cut partitioning and clustering.
IEEE Trans. on CAD of Integrated Circuits and Systems,
1992, 11, 1074-1085
Inproceedings (1454017)
Symeonidis, P.; Nanopoulos, A. & Manolopoulos, Y.
Tag recommendations based on tensor dimensionality reduction
ACM,
2008, 43-50
Unpublished (ranade:sus)
Ranade, A.
Some uses of spectral methods
2000
Inproceedings (schmitz2006content)
Schmitz, C.; Hotho, A.; Jäschke, R. & Stumme, G.
Sure, Y. & Domingue, J. (ed.)
Content Aggregation on Knowledge Bases using Graph Clustering
Springer,
2006, 4011, 530-544
Incollection (springerlink:10.1007/978-3-540-74839-7_12)
Brandes, U.; Delling, D.; Gaertler, M.; Görke, R.; Hoefer, M.; Nikoloski, Z. & Wagner, D.
Brandstädt, A.; Kratsch, D. & Müller, H. (ed.)
On Finding Graph Clusterings with Maximum Modularity
Springer,
2007, 4769, 121-132
Book (diestel2006graphentheorie)
Diestel, R.
Graph Theory
Springer-Verlag Heidelberg, New York,
2005, I-XVI, 1-344