The Stanford GraphBase. A platform for combinatorial computing.

MaRDI QIDQ3393340zbMATH OpenFDO

Authors Donald E. Knuth

Publication date 20 August 2009

zbMATH Keywords

combinatorial algorithms

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 704893
• scientific article; zbMATH DE number 194946
• scientific article; zbMATH DE number 437527
• The art of computer programming. Vol. 4, Fasc. 0--4. Fasc. 0: Introduction to combinatorial algorithms and Boolean functions. Fasc. 1: Bitwise tricks \& techniques, binary decision diagrams. Fasc. 2: Generating all tuples and permutations. Fasc. 3: Genera
• The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.

Cited in

(5)

• scientific article; zbMATH DE number 437527 (Why is no real title available?)
• Multiple order local information model for link prediction in complex networks
• An in-situ algorithm for expanding a graph
• The Open Graph Archive: a community-driven effort
• scientific article; zbMATH DE number 704893 (Why is no real title available?)

Describes a project that uses

Uses Software

• GraphBase

This page was built for publication: The Stanford GraphBase. A platform for combinatorial computing.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3393340)