Graph Drawing 2001 Contest - Graph A
Graph Drawing 2001 Contest task description for
Graph A in Pajek's format.
Selected citation networks from Garfield's collection
Citation networks in Pajek's format obtained from the
Garfield's collection of citation network datasets produced using
HistCite software. All of these networks are the result of searches
in the WebofScience and are used with the permission of
ISI of Philadelphia. Please acknowledge
this when publishing results based on these data.
n - number of vertices
m - and number of arcs
m0 - number of loops
n0 - number of isolated vertices
nC - size of the largest weakly connected component
kC - number of nontrivial weakly connected components
h - depth - number of levels
Δi - maximum input degree
Δo - maximum output degree
In last three columns are the numbers of strongly connected components (cyclic parts)
of size 2, 3 and 4.
- Batagelj V.: Some Mathematics of Network Analysis.
Network Seminar, Department of Sociology,
University of Pittsburgh, January 21, 1991.
- Batagelj V., Mrvar A.:
Graph Drawing Contest 2001 Layouts.
- Garfield E, Sher IH, and Torpie RJ.:
The Use of Citation Data in Writing the History of Science.
Philadelphia: The Institute for Scientific Information, December 1964.
- Garfield E.:
From Computational Linguistics to Algorithmic Historiography,
paper presented at the Symposium in Honor of Casimir Borkowski
at the University of Pittsburgh School of Information Sciences,
September 19, 2001.
- Hummon N.P., Doreian P.:
Connectivity in a Citation Network: The Development of DNA Theory.
Social Networks, 11(1989) 39-63.