The Stanford GraphBase - a platform for combinatorial computing

By Donald Ervin Knuth. 1993

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Graph Learning

Citations in the corpus

node2vec: Scalable Feature Learning for Networks (2016, methodology): “We use a network where nodes correspond to characters in the novel Les Misérables [13] and edges connect coappearing characters.”
Overlapping community detection using Bayesian non-negative matrix factorization. (2011, background): “com/ [36] D.”
The Structure and Function of Complex Networks (2003, background): “Another important set of experiments are the famous characters, such as the protagonists of Tolstoy’s Anna Karenina [244] or Marvel Comics superheroes [10].”
An efficient and principled method for detecting communities in networks (2011, methodology): “This network, compiled by Knuth [25], represents the patterns of interactions between the ﬁctional characters in the novel Les Mis´erables by Victor Hugo.”
Oppositional biogeography-based optimization (2009, background): “2 Traveling Salesman Problem The traveling salesman problem (TSP) [197] is a well-known closed path combinatorial problem.”
Ten years of research change using Google Trends: From the perspective of big data utilizations and applications (2017, background): “1) to analyze the similarity and community of co-occurrences in these two-mode networks (Blondel et al., 2008; Knuth, 1993).”
Pregel: a system for large-scale graph processing (2010, methodology): “3. Using a single-computer graph algorithm library, such as BGL [43], LEDA [35], NetworkX [25], JDSL [20], Stanford GraphBase [ 29 ], or FGL [16], limiting the scale of problems that can be addressed.”
Listing All Maximal Cliques in Large Sparse Real-World Graphs (2011, unknown): “1 polbooks [28] 105 441 6 199 <0:01 <0:01 <0:01 <0:01 adjnoun [29] 112 425 6 303 <0:01 <0:01 <0:01 <0:01 football [15] 115 613 8 281 <0:01 <0:01 <0:01 <0:01 lesmis [25] 77 254 9 59 <0:01 <0:01 <0:01 <0:01 celegensneural [47] 297 1,248 9 856 <0:01 &l”
The Algorithm Design Manual (2020, methodology): “If anybody’s programs deserve to be read, it is Knuth’s, and [Knu94] contains the full source code of the system.”
Framework for Performance Evaluation of Face, Text, and Vehicle Detection and Tracking in Video: Data, Metrics, and Protocol (2009, unknown): “More details about the assignment problem and its solution can be found in standard textbooks [37], [38], [39].”
CDER: Efficient MT Evaluation Using Block Movements (2006, methodology): “Instead, a modification of the Hungarian algorithm (Knuth, 1993) can be used.”
The DLV system for knowledge representation and reasoning (2002, methodology): “The input graphs for Reachability were generated by means of the Stanford GraphBase [Knuth 1994], using the function random graph(#nodes, #arcs, 0, 0, 0, 0, 0, 0, 0, 0) with a ratio of 3:1 between #arcs and #nodes.”