Authored by , Professor Emeritus at the University of Maine, this book is a classic concise, undergraduate-level text designed for students in computer science and mathematics. Its brevity is a key asset, focusing on a core set of topics essential for a strong foundation in discrete methods.
Recognizing the audience (computer scientists), the book touches upon algorithms and recurrence relations. introductory discrete mathematics balakrishnan pdf
Covers practical problems like minimal spanning trees (Kruskal’s and Prim’s algorithms) and shortest path problems (Dijkstra’s and Floyd-Warshall algorithms). Computational Theory: The appendix provides a non-technical introduction to NP-completeness and algorithmic complexity. Amazon.com Key Features Introductory Discrete Mathematics: Balakrishnan, V. K. Authored by , Professor Emeritus at the University
Discussion of algorithms specifically designed for network optimization and coding problems Google Books Reader Experience & Difficulty While titled "Introductory," the book is often described as and potentially challenging for absolute beginners this book is a classic concise