Combinatorics for Computer Science (Dover Books on Mathematics)
| Author | : | |
| Rating | : | 4.67 (862 Votes) |
| Asin | : | 0486420760 |
| Format Type | : | paperback |
| Number of Pages | : | 523 Pages |
| Publish Date | : | 2015-03-05 |
| Language | : | English |
DESCRIPTION:
References for Linear Order & for Graphs, Trees, and Recursions. Useful guide covers two major subdivisions of combinatorics — enumeration and graph theory — with emphasis on conceptual needs of computer science. Invaluable practical resource for graduate students, advanced undergraduates, and professionals with an interest in algorithm design and other aspects of computer science and combinatorics. 219 figures.. 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
good textbook, outstanding guide for programmers I am a software engineer by trade, and this is the book I wish I had with me.Today, I don't see it as a textbook for coursework, but I think there are probably better in today's world. Though I will let the other reviewer's viewpoint on this address that issue.However, this is an excellent book for any programmer or software engineer. Honestly I doubt most programmers have this math background ( okay contradicting myself a little, but I did say the other reviewer covered the academic side of this ).The structure of this books makes it an excellent self. "Excellent reference for data structure algorithm complexity." according to Bruce G. This excellent reference has numerous examples, definitions and exercises covering trees, graphs, linked lists etc. This book provides a great companion to any data structures text.