Algorithmic Combinatorics
Listing, ranking, and uniform generation of combinatorial objects.
Algorithmic Combinatorics. Listing, ranking, and uniform generation of combinatorial objects.
Foundations and canonical references
The standard treatments of algorithmic combinatorics approach the subject from complementary angles. Kreher, Combinatorial Algorithms (1998) is the anchor reference for the subject and lays out the core definitions, theorems, and worked examples that practitioners return to. Knuth, The Art of Computer Programming, Volume 4A: Combinatorial Algorithms (2011) gives a parallel, more proof-oriented exposition of the same material and is widely used as a graduate text.
Open methodological questions for algorithmic combinatorics include sharpening the bridges between foundational theory and computational practice, extending classical results to broader or more structured settings, and integrating the techniques surveyed above with adjacent mathematical disciplines. The references listed in this page are the entry points that current work builds on.
Prerequisites
Sources
- textbook · primary · 1998Combinatorial Algorithmskreher-1998, stinson-1998
- textbook · primary · 2011The Art of Computer Programming, Volume 4A: Combinatorial Algorithmsknuth-2011
In context
Where this topic sits in the prerequisite graph. Click any node to jump.
Review this topic
This page was drafted by an agent and is waiting on expert review. Spotted a wrong prerequisite, a missing concept, a misattributed source, or a factual slip? Tell us — your review opens a tracked issue maintainers act on.