Applied Combinatorics
Published on 1. July 1984
Book
Hardback
640 pages
978-0-13-039313-5 (ISBN)
Description
Our most applied text, including topics in optimization.
More details
Language
English
Place of publication
United States
Publishing group
Pearson Education (US)
Target group
Professional and scholarly
Dimensions
Height: 244 mm
Width: 186 mm
Thickness: 30 mm
Weight
1081 gr
ISBN-13
978-0-13-039313-5 (9780130393135)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
New editions
Fred Roberts | Barry Tesman
Applied Combinatorics
Book
09/2004
2nd Edition
Pearson
€63.13
Article is exhausted; no reprint
Content
Notation. 1. What is Combinatorics? I. The Basic Tools of Combinatorics. 2. Basic Counting Rules 3. Introduction to Graph Theory. II. The Counting Problem. 4. Generating Functions and Their Applications. 5. Recurrence Relations. 7. The Polya Theory of Counting. III. The Existence Problem. 8. The Pigeonhole Principle and its Generalizations. 9. Experimental Design. 10. Coding Theory. 11. Existence Problems in Graph Theory. IV. Combinatorial Optimization. 12. Matching and Covering. 13. Optimization Problems for Graphs and Networks. Answers to Selected Exercises. Author Index. Subject Index.