Notes on introductory combinatorics
Developed from the authors 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. Elementary subjects suc...
Guardat en:
| Autors principals: | , , |
|---|---|
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Boston, MA :
Birkhäuser Boston
[20..].
Cham : Springer Nature |
| Col·lecció: | Progress in Computer Science and Applied Logic
4 |
| Accés en línia: | Accès sur la plateforme de l'éditeur Accès sur la plateforme de l'éditeur (Springer) Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Notes on Introductory Combinatorics, Texte imprimé, 9780817649548 • Notes on introductory combinatorics, George Pólya, Robert E. Tarjan, Donald R. Woods, 1983, Boston, Birkhäuser, 1 vol. (190 p.), Progress in computer science, 0-8176-3123-2 |
Taula de continguts:
- Combinations and Permutations
- Generating Functions
- Principle of Inclusion and Exclusion
- Stirling Numbers
- P#x00F3;lya#x2019;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.