The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1 Donald E. Knuth
Publisher: Addison-Wesley Professional

Looks like Nauty's geng does allow constraints on degree (for k = 3 -d1 as lower and -D3 for upper). On January 10, 1938, computer scientist Donald Knuth, developer of the seminal computer science textbooks 'The Art of Computer Programming', was born. This sounds like something that might be in "The Art of Computer Programming, Volume 4. Addison-Wesley Professional, ISBN 0-201-89685-0; Volume 4A: Combinatorial Algorithms, Part 1, 2011. Knuth, The Art of Computer Programming, Volumes 1–4, Addison-Wesley Professional. 3: Sorting and Searching (2nd Edition), 1998. Volume 1: Fundamental Algorithms (3rd edition), 1997. What he wrote instead turned into his monumental series The Art of Computer Programming (3 vol., 1968-), an overview of programming algorithms, each described with mathematical rigor, that has been translated into six languages. The seminal study of programming techniques has long-time been considered to be Donald Knuth's “The Art of Computer Programming.” Unfortunately, new volumes in the series have been coming out slower than year-old ketchup out of a bottle. It was news of some note, therefore, when it was announced this week that Volume 4A of his magnum opus (which covers Combinatorial Algorithms, Part 1, for the curious) was available for purchase. The Art of Computer Programming, Volume 4A: Combinatorial Algorithms,Part 1Ebook Free DownloadThe Art of Computer Programming, Volume 4A: Combinatorial Algorithms,Part 1. Kindle eBook Free Download: The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1 | PDF, EPUB | ISBN: 0201038048 | 2011-01-22 | English | RapidShare. Volume 4A: Combinatorial Algorithms, Part 1. Combinatorial Algorithms, the 4th Volume of Knuth's, The Art of Computer Programming, is widely regarded as the most comprehensive book on its topic. Disappointed with the state of computer typesetting, Knuth developed a . Could anyone refer me to an algorithm that I could read up on that can do all this in a smarter way?