@book{diestel2006graphentheorie,
  author = {Diestel, Reinhard},
  edition = {3 (electronic edition)},
  interhash = {f2579f4c24fdf2233f0a0565b34e8ac1},
  intrahash = {bf75f61d316d1d149e2b7e0d72cd937c},
  pages = {I-XVI, 1-344},
  publisher = {Springer-Verlag Heidelberg, New York},
  title = {Graph Theory},
  url = {http://www.math.ubc.ca/~solymosi/2007/443/GraphTheoryIII.pdf},
  year = 2005
}

@incollection{springerlink:10.1007/978-3-540-74839-7_12,
  abstract = {Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the complex systems literature, although its properties are not well understood. We study the problem of finding clusterings with maximum modularity, thus providing theoretical foundations for past and present work based on this measure. More precisely, we prove the conjectured hardness of maximizing modularity both in the general case and with the restriction to cuts, and give an Integer Linear Programming formulation. This is complemented by first insights into the behavior and performance of the commonly applied greedy agglomaration approach.},
  address = {Berlin / Heidelberg},
  affiliation = {Department of Computer and Information Science, University of Konstanz},
  author = {Brandes, Ulrik and Delling, Daniel and Gaertler, Marco and Görke, Robert and Hoefer, Martin and Nikoloski, Zoran and Wagner, Dorothea},
  booktitle = {Graph-Theoretic Concepts in Computer Science},
  doi = {10.1007/978-3-540-74839-7_12},
  editor = {Brandstädt, Andreas and Kratsch, Dieter and Müller, Haiko},
  interhash = {b335302041d1865d7cfec7467e8e2999},
  intrahash = {6fd10991ee4e3880c64c11862884ead7},
  isbn = {978-3-540-74838-0},
  keyword = {Computer Science},
  openurl = {http://www.blub.de},
  pages = {121-132},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {On Finding Graph Clusterings with Maximum Modularity},
  url = {http://dx.doi.org/10.1007/978-3-540-74839-7_12},
  volume = 4769,
  year = 2007
}

@inproceedings{schmitz2006content,
  abstract = {Recently, research projects such as PADLR and SWAP
  have developed tools like Edutella or Bibster, which are targeted at
  establishing peer-to-peer knowledge management (P2PKM) systems.  In
  such a system, it is necessary to obtain provide brief semantic
  descriptions of peers, so that routing algorithms or matchmaking
  processes can make decisions about which communities peers should
  belong to, or to which peers a given query should be forwarded.

  This paper provides a graph clustering technique on
  knowledge bases for that purpose. Using this clustering, we can show
  that our strategy requires up to 58% fewer queries than the
  baselines to yield full recall in a bibliographic P2PKM scenario.},
  address = {Heidelberg},
  author = {Schmitz, Christoph and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd},
  booktitle = {The Semantic Web: Research and Applications},
  editor = {Sure, York and Domingue, John},
  interhash = {d2ddbb8f90cd271dc18670e4c940ccfb},
  intrahash = {1788c88e04112a4491f19dfffb8dc39e},
  pages = {530-544},
  publisher = {Springer},
  series = {LNAI},
  title = {Content Aggregation on Knowledge Bases using Graph Clustering},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2006/schmitz2006content.pdf},
  volume = 4011,
  year = 2006
}

@article{newman2006fcs,
  author = {Newman, MEJ},
  interhash = {5003bcb34d28e1e4bc301fafb9a12c72},
  intrahash = {090a24e34da3d0ab3d14d61dd3ad3285},
  journal = {Physical Review E},
  number = 3,
  pages = 36104,
  publisher = {APS},
  title = {{Finding community structure in networks using the eigenvectors of matrices}},
  volume = 74,
  year = 2006
}

@book{Chung:1997,
  author = {Chung, F. R. K.},
  interhash = {0f0fd754924d4dd54bc185bd1c71d00b},
  intrahash = {95ef10b5a69a03d8507240b6cf410f8a},
  publisher = {American Mathematical Society},
  title = {Spectral Graph Theory},
  year = 1997
}