@incollection{batagelj1999partitioning,
  abstract = {The structure of large graphs can be revealed by partitioning graphs to smaller parts, which are easier to handle. In the paper we propose the use of core decomposition as an efficient approach for partitioning large graphs. On the selected subgraphs, computationally more intensive, clustering and blockmodeling can be used to analyze their internal structure. The approach is illustrated by an analysis of Snyder & Kick’s world trade graph.},
  address = {Berlin / Heidelberg},
  affiliation = {FMF, Department of Mathematics, and IMFM Department of Theoretical Computer Science University of Ljubljana Jadranska 19 1000 Ljubljana Slovenia},
  author = {Batagelj, Vladimir and Mrvar, Andrej and Zaveršnik, Matjaž},
  booktitle = {Graph Drawing},
  doi = {10.1007/3-540-46648-7_9},
  editor = {Kratochvíyl, Jan},
  interhash = {223ade3dd692bb262a6398e1442b4dfd},
  intrahash = {2e005638761fc15757dd18113783aa97},
  isbn = {978-3-540-66904-3},
  keyword = {Computer Science},
  pages = {90-97},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Partitioning Approach to Visualization of Large Graphs},
  url = {http://dx.doi.org/10.1007/3-540-46648-7_9},
  volume = 1731,
  year = 1999
}