Partitioning Approach to Visualization of Large Graphs
V. Batagelj, A. Mrvar, и M. Zaveršnik.
Graph Drawing, том 1731 из Lecture Notes in Computer Science, Springer, Berlin / Heidelberg, (1999)

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.

URL

http://dx.doi.org/10.1007/3-540-46648-7_9

искать в

К этой публикации ещё не было создано рецензий.

распределение оценок

средняя оценка пользователей0,0 из 5.0 на основе 0 рецензий

Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)

@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.},
  added-at = {2012-10-04T16:27:55.000+0200},
  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ž},
  biburl = {https://puma.uni-kassel.de/bibtex/22e005638761fc15757dd18113783aa97/stephandoerfel},
  booktitle = {Graph Drawing},
  description = {Abstract - SpringerLink},
  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},
  keywords = {core graph},
  pages = {90-97},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  timestamp = {2012-10-04T16:27:55.000+0200},
  title = {Partitioning Approach to Visualization of Large Graphs},
  url = {http://dx.doi.org/10.1007/3-540-46648-7_9},
  volume = 1731,
  year = 1999
}

%0 Book Section
%1 batagelj1999partitioning
%A Batagelj, Vladimir
%A Mrvar, Andrej
%A Zaveršnik, Matjaž
%B Graph Drawing
%C Berlin / Heidelberg
%D 1999
%E Kratochvíyl, Jan
%I Springer
%K core graph
%P 90-97
%R 10.1007/3-540-46648-7_9
%T Partitioning Approach to Visualization of Large Graphs
%U http://dx.doi.org/10.1007/3-540-46648-7_9
%V 1731
%X 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.
%@ 978-3-540-66904-3

PUMA

Partitioning Approach to Visualization of Large Graphs
V. Batagelj, A. Mrvar, и M. Zaveršnik.
Graph Drawing, том 1731 из Lecture Notes in Computer Science, Springer, Berlin / Heidelberg, (1999)

Tags

Пользователи данного ресурса

Комментарии и рецензии

Цитировать эту публикацию

PUMA

Partitioning Approach to Visualization of Large GraphsV. Batagelj, A. Mrvar, и M. Zaveršnik. Graph Drawing, том 1731 из Lecture Notes in Computer Science, Springer, Berlin / Heidelberg, (1999)

Tags

Пользователи данного ресурса

Комментарии и рецензии

Цитировать эту публикацию

Partitioning Approach to Visualization of Large Graphs
V. Batagelj, A. Mrvar, и M. Zaveršnik.
Graph Drawing, том 1731 из Lecture Notes in Computer Science, Springer, Berlin / Heidelberg, (1999)