Combinatorics and its algorithms

Author: Yang Zhensheng
Publisher:
Publish Date: 2003-04-01
Features: Combinatorics and Algorithms systematically introduces the fundamental principles and algorithms of combinatorics. The book is well-structured, concise in selection, easy to understand, practical, emphasizes analysis, and focuses on algorithms. The main contents include the research objects of combinatorics, permutations and combinations, the principle of inclusion and exclusion, the pigeonhole principle, generating functions, recurrence relations, Polya's theorem, graph theory basics, Latin squares and block designs, linear programming, and combinatorial optimization algorithms. Some of the content reflects the author's new research achievements. The book is written in a clear and concise manner with abundant examples, offering great inspiration. Each chapter is accompanied by exercises for readers to practice. This book can serve as a textbook for graduate students and senior undergraduate students in computer science, management science, electronic engineering, and digital communication, as well as providing sufficient reference value for relevant technical personnel.