@Inproceedings{1454017, author = {Symeonidis, Panagiotis and Nanopoulos, Alexandros and Manolopoulos, Yannis}, title = {Tag recommendations based on tensor dimensionality reduction}, year = {2008}, number = {}, url = {http://portal.acm.org/citation.cfm?id=1454017}, doi = {http://doi.acm.org/10.1145/1454008.1454017}, const = {\ text} } @Incollection{springerlink:10.1007/978-3-540-74839-7_12, author = {Brandes, Ulrik and Delling, Daniel and Gaertler, Marco and Görke, Robert and Hoefer, Martin and Nikoloski, Zoran and Wagner, Dorothea}, title = {On Finding Graph Clusterings with Maximum Modularity}, year = {2007}, number = {}, url = {http://dx.doi.org/10.1007/978-3-540-74839-7_12}, doi = {10.1007/978-3-540-74839-7_12}, const = {\ text} } @Article{4389477, author = {Spielman, D.A.}, title = {Spectral Graph Theory and its Applications}, journal = {Foundations of Computer Science, 2007. FOCS '07. 48th Annual IEEE Symposium on}, year = {2007}, number = {}, url = {}, doi = {10.1109/FOCS.2007.56}, const = {\ text} } @Article{newman2006fcs, author = {Newman, MEJ}, title = {Finding community structure in networks using the eigenvectors of matrices}, journal = {Physical Review E}, year = {2006}, number = {3}, url = {}, const = {\ text} } @Inproceedings{schmitz2006content, author = {Schmitz, Christoph and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd}, title = {Content Aggregation on Knowledge Bases using Graph Clustering}, year = {2006}, number = {}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2006/schmitz2006content.pdf}, const = {\ text} } @Article{Dias2005240, author = {Dias, Vânia M.F. and de Figueiredo, Celina M.H. and Szwarcfiter, Jayme L.}, title = {Generating bicliques of a graph in lexicographic order}, journal = {Theoretical Computer Science}, year = {2005}, number = {1-3}, url = {http://www.sciencedirect.com/science/article/B6V1G-4FD0HTT-3/2/7efa1ee4d7b4823c7315a58b94f2f280}, doi = {DOI: 10.1016/j.tcs.2005.01.014}, const = {\ text} } @Book{diestel2006graphentheorie, author = {Diestel, Reinhard}, title = {Graph Theory}, year = {2005}, number = {}, url = {http://www.math.ubc.ca/~solymosi/2007/443/GraphTheoryIII.pdf}, const = {\ text} } @Article{haveliwala8090seg, author = {Haveliwala, T.H. and Kamvar, S.D.}, title = {The second eigenvalue of the Google matrix}, journal = {A Stanford University Technical Report http://dbpubs. stanford. edu}, year = {2003}, number = {}, url = {}, const = {\ text} } @Inproceedings{yu2003multiclass, author = {Yu, Stella X. and Shi, Jianbo}, title = {Multiclass Spectral Clustering}, year = {2003}, number = {}, url = {}, const = {\ text} } @Unpublished{graphseparators02, author = {Blelloch, Guy}, title = {Graph Separators}, year = {2002}, number = {}, url = {}, const = {\ text} } @Inproceedings{coclustering01, author = {Dhillon, Inderjit S.}, title = {Co-clustering documents and words using bipartite spectral graph partitioning}, year = {2001}, number = {}, url = {http://portal.acm.org/citation.cfm?id=502512.502550}, doi = {10.1145/502512.502550}, const = {\ text} } @Misc{Monien_onspectral, author = {Monien, B.}, title = {On Spectral Bounds for the k-Partitioning of Graphs}, year = {2001}, number = {}, url = {}, const = {\ text} } @Unpublished{ranade:sus, author = {Ranade, A.G.}, title = {Some uses of spectral methods}, year = {2000}, number = {}, url = {}, const = {\ text} } @Book{Chung:1997, author = {Chung, F. R. K.}, title = {Spectral Graph Theory}, year = {1997}, number = {}, url = {}, const = {\ text} } @Article{journals/tcad/ChanSZ94, author = {Chan, Pak K. and Schlag, Martine D. F. and Zien, Jason Y.}, title = {Spectral K-way ratio-cut partitioning and clustering.}, journal = {IEEE Trans. on CAD of Integrated Circuits and Systems}, year = {1994}, number = {9}, url = {http://dblp.uni-trier.de/db/journals/tcad/tcad13.html#ChanSZ94}, const = {\ text} } @Article{journals/tcad/HagenK92, author = {Hagen, Lars W. and Kahng, Andrew B.}, title = {New spectral methods for ratio cut partitioning and clustering.}, journal = {IEEE Trans. on CAD of Integrated Circuits and Systems}, year = {1992}, number = {9}, url = {http://dblp.uni-trier.de/db/journals/tcad/tcad11.html#HagenK92}, const = {\ text} } @Article{mohar1991lsg, author = {Mohar, B.}, title = {The Laplacian spectrum of graphs}, journal = {Graph Theory, Combinatorics, and Applications}, year = {1991}, number = {}, url = {}, const = {\ text} } @Article{partitioning89, author = {Pothen, A. and Simon, H.D. and Liou, K.P.}, title = {Partitioning Sparse Matrices with Eigenvectors of Graphs}, journal = {SIAM J. MATRIX ANAL. APPLIC.}, year = {1990}, number = {3}, url = {http://ntrs.nasa.gov/archive/nasa/casi.ntrs.nasa.gov/19970011963_1997016998.pdf }, const = {\ text} } @Article{46243, author = {Johnson, David S. and Papadimitriou, Christos H.}, title = {On generating all maximal independent sets}, journal = {Inf. Process. Lett.}, year = {1988}, number = {3}, url = {http://portal.acm.org/citation.cfm?id=46241.46243}, doi = {http://dx.doi.org/10.1016/0020-0190(88)90065-8}, const = {\ text} } @Article{fiedler1975pen, author = {Fiedler, M.}, title = {A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory}, journal = {Czechoslovak Mathematical Journal}, year = {1975}, number = {100}, url = {}, const = {\ text} }