Graph Theory. I-XVI, 1-344, Springer-Verlag Heidelberg, New York, 2005. [PUMA: book density diesel graph theory] URL
On Finding Graph Clusterings with Maximum Modularity. In Andreas Brandstädt, Dieter Kratsch, und Haiko Müller (Hrsg.), Graph-Theoretic Concepts in Computer Science, (4769):121-132, Springer, Berlin / Heidelberg, 2007. [PUMA: clustering graph modularity theory] URL
Content Aggregation on Knowledge Bases using Graph Clustering. In York Sure, und John Domingue (Hrsg.), The Semantic Web: Research and Applications, (4011):530-544, Springer, Heidelberg, 2006. [PUMA: 2006 aggregation clustering content graph itegpub l3s myown nepomuk ontologies ontology seminar2006 theory] URL
Finding community structure in networks using the eigenvectors of matrices. Physical Review E, (74)3:36104, APS, 2006. [PUMA: community detection graph modularity spectral theory]
Spectral Graph Theory. American Mathematical Society, 1997. [PUMA: graph spectral theory]
On Spectral Bounds for the k-Partitioning of Graphs. 2001. [PUMA: graph spectral theory]
The Laplacian spectrum of graphs. Graph Theory, Combinatorics, and Applications, (2):871--898, New York: Wiley, 1991. [PUMA: graph laplacian spectral survey theory]
Spectral Graph Theory and its Applications. Foundations of Computer Science, 2007. FOCS '07. 48th Annual IEEE Symposium on, 29-38, Oktober 2007. [PUMA: graph spectral theory]
On generating all maximal independent sets. Inf. Process. Lett., (27)3:119--123, Elsevier North-Holland, Inc., Amsterdam, The Netherlands, The Netherlands, 1988. [PUMA: complexity graph independent sets theory] URL
Generating bicliques of a graph in lexicographic order. Theoretical Computer Science, (337)1-3:240 - 248, 2005. [PUMA: conp graph independent set theory] URL
A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czechoslovak Mathematical Journal, (25)100:619--633, 1975. [PUMA: graph spectral theory]
The second eigenvalue of the Google matrix. A Stanford University Technical Report http://dbpubs. stanford. edu, 2003. [PUMA: graph pagerank spectral theory]
Co-clustering documents and words using bipartite spectral graph partitioning. KDD '01: Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, 269--274, ACM Press, New York, NY, USA, 2001. [PUMA: community detection graph spectral theory] URL
Graph Separators. 2002. [PUMA: graph separators theory]
Partitioning Sparse Matrices with Eigenvectors of Graphs. SIAM J. MATRIX ANAL. APPLIC., (11)3:430--452, 1990. [PUMA: clustering community graph partitioning spectral theory] URL
Spectral K-way ratio-cut partitioning and clustering.. IEEE Trans. on CAD of Integrated Circuits and Systems, (13)9:1088-1096, 1994. [PUMA: community detection graph partitioning spectral theory] URL
Multiclass Spectral Clustering. Proc. International Conference on Computer Vision (ICCV 03), Nice, France, Oktober 2003. [PUMA: Spectral graph partitioning theory]
New spectral methods for ratio cut partitioning and clustering.. IEEE Trans. on CAD of Integrated Circuits and Systems, (11)9:1074-1085, 1992. [PUMA: graph partitioning spectral theory] URL
Tag recommendations based on tensor dimensionality reduction. RecSys '08: Proceedings of the 2008 ACM conference on Recommender systems, 43--50, ACM, New York, NY, USA, 2008. [PUMA: community detection graph recommender spectral tag theory] URL
Some uses of spectral methods. 2000. [PUMA: clustering graph spectral svd theory]