Editing The Art of Computer Programming (section)

===Planned===
====Volumes 4C, 4D, 4E, 4F – Combinatorial algorithms<ref>{{cite web |last1=D'Agostino |first1=Susan |title=The Computer Scientist Who Can't Stop Telling Stories |url=https://www.quantamagazine.org/computer-scientist-donald-knuth-cant-stop-telling-stories-20200416 |website=Quanta Magazine |access-date=2024-11-26 |date=2020-04-16 |quote="Now 82, he’s hard at work on part B of volume 4, and he anticipates that the book will have at least parts A through F." |archive-date=2024-11-27  |archive-url=https://web.archive.org/web/20241127003657/https://www.quantamagazine.org/computer-scientist-donald-knuth-cant-stop-telling-stories-20200416/ |url-status=live }}</ref>====
* Chapter 7&nbsp;– Combinatorial searching (continued)
** 7.2. Generating all possibilities (continued)
*** 7.2.2. [[Backtracking|Backtrack programming]] (continued)
**** 7.2.2.3. [[Constraint Satisfaction Problem|Constraint satisfaction]] (released as Pre-Fascicle 7A)
**** 7.2.2.4. [[Hamiltonian path problem|Hamiltonian paths]] and cycles
**** 7.2.2.5. [[Clique problem|Cliques]]
**** 7.2.2.6. Covers ([[vertex cover]], [[set cover problem]], [[exact cover]], [[clique cover]])
**** 7.2.2.7. Squares
**** 7.2.2.8. A potpourri of puzzles (includes [[perfect digital invariant]])
**** 7.2.2.9. Estimating backtrack costs (chapter 6 of "Selected Papers on Analysis of Algorithms", and Fascicle 5, pp.&nbsp;44−47, under the heading "Running time estimates")
*** 7.2.3. Generating inequivalent patterns (includes discussion of [[Pólya enumeration theorem]]) (see "Techniques for Isomorph Rejection", chapter 4 of "Classification Algorithms for Codes and Designs" by Kaski and Östergård)
** 7.3. [[Shortest path problem|Shortest paths]]
** 7.4. [[Graph algorithms]]
*** 7.4.1. Components and traversal
**** 7.4.1.1. [[Union-find algorithm]]s
**** 7.4.1.2. [[Depth-first search]]
**** 7.4.1.3. Vertex and edge connectivity
*** 7.4.2. Special classes of graphs
*** 7.4.3. [[Expander graph]]s
*** 7.4.4. [[Random graph]]s
** 7.5. Graphs and optimization
*** 7.5.1. Bipartite matching (including [[Maximum cardinality matching|maximum-cardinality matching]], [[stable marriage problem]], [https://cs.stanford.edu/~knuth/ms.html mariages stables])
*** 7.5.2. [[Assignment problem|The assignment problem]]
*** 7.5.3. [[Network flow problem|Network flows]]
*** 7.5.4. Optimum subtrees
*** 7.5.5. Optimum matching
*** 7.5.6. Optimum orderings
** 7.6. Independence theory
*** 7.6.1. Independence structures
*** 7.6.2. Efficient [[matroid]] algorithms
** 7.7. Discrete [[dynamic programming]] (see also [[Transfer-matrix method (statistical mechanics)|transfer-matrix method]])
** 7.8. [[Branch-and-bound]] techniques
** 7.9. Herculean tasks (aka [[NP-hard]] problems)
** 7.10. [[Approximation algorithm|Near-optimization]]
* Chapter 8&nbsp;– [[Recursion]] (chapter 22 of "Selected Papers on Analysis of Algorithms")

====Volume 5&nbsp;– Syntactic algorithms====
* Chapter 9&nbsp;– [[Lexical analysis|Lexical scanning]] (includes also [[Knuth–Morris–Pratt algorithm|string search]] and data compression)
* Chapter 10&nbsp;– [[Parsing]] techniques

====Volume 6&nbsp;– The theory of context-free languages<ref>{{cite web |url=https://cs.stanford.edu/~knuth/taocp.html#future |title=TAOCP – Future plans |access-date=2018-06-20  |archive-date=2019-08-03  |archive-url=https://web.archive.org/web/20190803223145/https://cs.stanford.edu/~knuth/taocp.html#future |url-status=live }}</ref>====
* Chapter 11&nbsp;– [[Mathematical linguistics]]<ref name="brochure">{{cite web |url=https://cs.stanford.edu/~knuth/brochure.pdf |title=TAOCP – Brochure |access-date=2024-11-26  |archive-date=2024-09-26  |archive-url=https://web.archive.org/web/20240926010938/https://cs.stanford.edu/~knuth/brochure.pdf |url-status=live }}</ref>

====Volume 7&nbsp;– Compiler techniques====
* Chapter 12&nbsp;– [[Programming language translation]]<ref name="brochure" />