logo Netzschleuder network catalog, repository, and centrifuge

compgeom_collab — Computational geometry collaborations (2002)

Description

Collaborations among authors in computational geometry, from the Computational Geometry Database geombib (version of February 2002), a bibliography started in 1986 by merging lists of references compiled by H. Edelsbrunner and J. van Leeuwen, and by L. Guibas and J. Stolfi, and maintained by B. Jones. Two authors are connected if they wrote a common work (paper, book, etc.), and the edge is weighted by the number of their common works. The network was produced by V. Batagelj and M. Zaveršnik, who manually unified the different spellings of the names of the same author (e.g. "R.L. Drysdale" and "Robert L. Scot Drysdale"), reducing the network from 9072 to 7343 authors. No provision is made to discern different persons with the same name. Authors without coauthored works appear as isolated nodes.

The network has the following properties:

  • (Node) name: the name of the author.
  • (Edge) weight: the number of common works.
Tags
Social Collaboration Weighted Metadata
Added
2026-10-25
Citation
Upstream URL OK
https://web.archive.org/web/20040331022241/http://vlado.fmf.uni-lj.si/pub/networks/data/collab/geom.htm
Networks
Tip: hover over a column header for a description.
Column legend
$\left<k\right>$
Mean degree
$\sigma_k$
Standard deviation of the degrees
$\lambda_h$
Largest eigenvalue of the Hashimoto (non-backtracking) matrix
$\tau$
Random walk mixing time
$r$
Degree assortativity
$c$
Global clustering coefficient
$\oslash$
(Pseudo-) diameter
$S$
Relative size of the largest component
NPs
Node properties
EPs
Edge properties
Name Nodes Edges $\left<k\right>$ $\sigma_k$ $\lambda_h$ $\tau$ $r$ $c$ $\oslash$ $S$ Kind Mode NPs EPs gt GraphML GML csv
compgeom_collab 7,343 11,898 3.24 6.24 27.09 337.37 0.24 0.24 14 0.49 Undirected Unipartite name weight 193 KiB 259 KiB 258 KiB 220 KiB
Ridiculograms*
* These are automatically generated force-directed visualizations, and can be quite meaningless for networks both big and small. They should not be taken seriously as sources of scientific insight. See here for a discussion.