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.
Auflage
Sprache
Verlagsort
Zielgruppe
Für höhere Schule und Studium
Editions-Typ
Illustrationen
diagrams, tables, bibliography, index
Maße
Höhe: 242 mm
Breite: 182 mm
Gewicht
ISBN-13
978-0-13-039942-7 (9780130399427)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Klassifikation
Set theory and logic; combinatorics; generating functions; recurrence relations; graphs and digraphs; more on graphs and digraphs; trees and their applications; spanning tree problems; shortest path problems.
