Intended for second/third year courses in combinatorics or discrete structures/methods, this text seeks to develop the problem-solving skills in applied combinatorial mathematics which are necessary in computer science and decision science fields such as operations research and managerial science. Discrete methods in counting and graph theory are developed in a problem-solving setting. The book includes many applications to computer science, operations research and statistics.
Auflage
International 2 Revised ed
Sprache
Verlagsort
Verlagsgruppe
Zielgruppe
Für höhere Schule und Studium
Illustrationen
glossary, bibliography, index
Maße
Höhe: 229 mm
Breite: 152 mm
Gewicht
ISBN-13
978-0-471-11091-0 (9780471110910)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Klassifikation
Part One: Graph Theory: Elements of Graph Theory; Covering Circuits and Graph Colouring; Trees and Searching; Network Algorithms; Part Two: Enumeration: Generating Counting Methods for Selections and Arrangements; Generating Functions; Recurrence Relations; Inclusion-Exclusion; Part Three: Additional Topics: Polya's Enumeration Theorem; Games with Graphs.
