Notes on Introductory Combinatorics
Developed from the authors<U+0019> introductory combinatorics course, this book focuses on a branch of mathematics which plays a crucial role in computer science. Combinatorial methods provide many analytical tools used for determining the expected performance of computer algorithms. Elementar...
Main Authors: | , , |
---|---|
Corporate Author: | |
Format: | Electronic |
Language: | English |
Published: |
Boston :
Birkhũser Boston,
2010.
|
Edition: | 1st. |
Series: | Modern Birkhũser Classics
|
Subjects: | |
Online Access: | https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-0-8176-4953-1 |
Table of Contents:
- Introduction
- Combinations and Permutations
- Generating Functions
- Principle of Inclusion and Exclusion
- Stirling Numbers
- Pl̤ya's Theory of Counting
- Outlook
- Midterm Examination
- Ramsey Theory
- Matchings (Stable Marriages)
- Matchings (Maximum Matchings)
- Network Flow
- Hamiltonian and Eulerian Paths
- Planarity and the Four-Color Theorem
- Final Examination
- Bibliography.