The Stanford GraphBase. A platform for combinatorial computing.

zbMATH Open1198.68147MaRDI QIDQ3393340FDOQ3393340

Authors: Donald E. Knuth 

Publication date: 20 August 2009

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.

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)

Cited In (5)

• Title not available (Why is that?)
• An in-situ algorithm for expanding a graph
• Multiple order local information model for link prediction in complex networks
• The Open Graph Archive: a community-driven effort
• Title not available (Why is that?)

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)