Useful guide covers two major subdivisions of combinatorics - enumeration and graph theory - with emphasis on conceptual needs of computer science. Each part is divided into a "basic concepts" chapter emphasizing intuitive needs of the subject, followed by four "topics" chapters that explore these ideas in depth. Invaluable practical resource for graduate students, advanced undergraduates, and professionals with an interest in algorithm design and other aspects of computer science and combinatorics.

Скачать книгу бесплатно (djvu, 3.86 Mb)

---

Читать «Combinatorics for Computer Science»