The coauthorship network of researchers in computer science.  This
data was derived from the DBLP dataset at http://dblp.uni-trier.de.
We only consider coauthorship up to and including 2012.  Each node
represents a researcher and two nodes are linked by an edge if the
corresponding researchers have written a paper together.  Below is an
explanation of the files in this directory:

* yyyy.edge -- The edge list of a graph.  The graph is undirected and
  represents the coauthorship network of papers published in the given
  year.  Each line follows the format "u v", which denotes that nodes
  u and v have coauthored a paper in the year yyyy.  If a line follows
  the format "u u", this should not be interpreted as a self-loop.
  Rather, it denotes that researcher u did not write a paper with
  anyone in the given year.

* yyyy-node.map -- A mapping of node ID to researcher name.  This
  allows us to find out, for the given year and corresponding
  coauthorship network, the full name of each researcher.

1936
Nodes: 8
Edges: 0

1937
Nodes: 12
Edges:  0

1938
Nodes: 9
Edges: 1

1939
Nodes: 15
Edges:  0

1940
Nodes: 9
Edges: 2

1941
Nodes: 11
Edges:  0

1942
Nodes: 10
Edges:  1

1943
Nodes: 8
Edges: 0

1944
Nodes: 4
Edges: 0

1945
Nodes: 10
Edges:  2

1946
Nodes: 31
Edges:  4

1947
Nodes: 10
Edges:  2

1948
Nodes: 15
Edges:  2

1949
Nodes: 20
Edges:  1

1950
Nodes: 20
Edges:  2

1951
Nodes: 18
Edges:  2

1952
Nodes: 18
Edges:  5

1953
Nodes: 46
Edges:  0

1954
Nodes: 48
Edges:  8

1955
Nodes: 53
Edges: 12

1956
Nodes: 101
Edges:  25

1957
Nodes: 108
Edges:  39

1958
Nodes: 168
Edges:  53

1959
Nodes: 340
Edges: 159

1960
Nodes: 261
Edges: 128

1961
Nodes: 417
Edges: 146

1962
Nodes: 641
Edges: 273

1963
Nodes: 527
Edges: 260

1964
Nodes: 551
Edges: 197

1965
Nodes: 600
Edges: 264

1966
Nodes: 588
Edges: 173

1967
Nodes: 1,044
Edges:   480

1968
Nodes: 1,330
Edges:   664

1969
Nodes: 914
Edges: 346

1970
Nodes: 1,096
Edges:   464

1971
Nodes: 1,572
Edges:   877

1972
Nodes: 1,699
Edges:   865

1973
Nodes: 2,167
Edges: 1,107

1974
Nodes: 3,047
Edges: 2,222

1975
Nodes: 3,432
Edges: 2,027

1976
Nodes: 3,719
Edges: 2,392

1977
Nodes: 4,103
Edges: 2,889

1978
Nodes: 3,909
Edges: 2,738

1979
Nodes: 4,428
Edges: 3,390

1980
Nodes: 5,492
Edges: 4,092

1981
Nodes: 6,073
Edges: 5,165

1982
Nodes: 7,041
Edges: 5,586

1983
Nodes: 8,146
Edges: 6,971

1984
Nodes: 9,674
Edges: 8,598

1985
Nodes: 10,289
Edges:  9,371

1986
Nodes: 13,045
Edges: 12,503

1987
Nodes: 14,137
Edges: 13,322

1988
Nodes: 16,866
Edges: 17,216

1989
Nodes: 19,757
Edges: 20,071

1990
Nodes: 24,915
Edges: 26,742

1991
Nodes: 27,738
Edges: 31,703

1992
Nodes: 31,498
Edges: 36,775

1993
Nodes: 39,179
Edges: 50,379

1994
Nodes: 43,677
Edges: 56,412

1995
Nodes: 47,933
Edges: 66,385

1996
Nodes: 48,152
Edges: 66,763

1997
Nodes: 58,047
Edges: 85,423

1998
Nodes: 64,435
Edges: 99,949

1999
Nodes:  73,103
Edges: 116,110

2000
Nodes:  82,723
Edges: 135,054

2001
Nodes:  92,944
Edges: 159,330

2002
Nodes: 107,748
Edges: 199,449

2003
Nodes: 128,522
Edges: 252,476

2004
Nodes: 152,498
Edges: 309,210

2005
Nodes: 177,098
Edges: 371,931

2006
Nodes: 198,008
Edges: 430,376

2007
Nodes: 221,066
Edges: 486,832

2008
Nodes: 241,252
Edges: 545,342

2009
Nodes: 270,617
Edges: 634,317

2010
Nodes: 282,057
Edges: 683,299

2011
Nodes: 301,296
Edges: 749,874

2012
Nodes: 288,867
Edges: 735,310
