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.
"synopsis" may belong to another edition of this title.
V. K. Balakrishnan is Professor Emeritus at the University of Maine.
"About this title" may belong to another edition of this title.
US$ 4.00 shipping within U.S.A.
Destination, rates & speedsSeller: Book ReViews, Newton, KS, U.S.A.
Soft cover. Condition: As New. White covers. Bibliography. Answers to Selected Exercises. Index. Book as new. Seller Inventory # R1397
Quantity: 1 available
Seller: Anybook.com, Lincoln, United Kingdom
Condition: Poor. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. Book contains pen & pencil markings. In poor condition, suitable as a reading copy. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,500grams, ISBN:0134786785. Seller Inventory # 9476735
Quantity: 1 available
Seller: Anybook.com, Lincoln, United Kingdom
Condition: Fair. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. Clean from markings. In fair condition, suitable as a study copy. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,500grams, ISBN:0134786785. Seller Inventory # 9476736
Quantity: 1 available