This overview of discrete mathematics places special emphasis on combinatorics, graph theory and two important topics in network optimization with an algorithmic approach. The text provides a discussion of basic combinatorics and graph theory, with several combinational models. The text includes: a brief exposition of the theory of NP completeness; more than 100 diagrams and tables directly tied to subject matter; historical notes and references in each chapter; end-of-chapter exercises; and a bibliography.
- ISBN10 0130399426
- ISBN13 9780130399427
- Publish Date 1 January 1991 (first published December 1990)
- Publish Status Out of Print
- Out of Print 31 October 2009
- Publish Country US
- Imprint Pearson Education (US)
- Edition New edition
- Format Hardcover
- Pages 272
- Language English