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 subjec...

Description complète

Détails bibliographiques
Cote:Libro Electrónico
Auteurs principaux: Pólya, George (Auteur), Tarjan, Robert E. (Auteur), Woods, Donald R. (Auteur)
Collectivité auteur: SpringerLink (Online service)
Format: Électronique eBook
Langue:Inglés
Publié: Boston, MA : Birkhäuser Boston : Imprint: Birkhäuser, 2010.
Édition:1st ed. 2010.
Collection:Progress in Computer Science and Applied Logic, 4
Sujets:
Computer science.
Discrete mathematics.
Algorithms.
Mathematics-Data processing.
Numerical analysis.
Theory of Computation.
Discrete Mathematics.
Computational Mathematics and Numerical Analysis.
Numerical Analysis.
Accès en ligne:Texto Completo
Table des matières:
  • 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.

Documents similaires