Combinatorics for Computer Science Book

  Preface
  Acknowledgments
  Suggestions on How to Use This Book
  Study Guide for Part I: Linear Order
  Study Guide for Part II: Graphs, Trees, and Recursion Part I. Linear Order
  1. Basic concepts of Linear Order
  2. Topic I: Sorting
  3. Topic II: Basic Combinatorial Lists
  4. Topic III: Symmetry--Orbit Enumeration and Orderly Algorithms
  5. Topic IV: Some Classic Combinatorics
    A. Generating Functions
    B. The Principle of Inclusion-Exclusion
    C. Möbius Inversion
    D. Network Flows
      References for Linear Order Part II. Graphs, Trees, and Recursion
  6. Basic Concepts of Graphs, Trees, and Recursion
  7. Topic I: Depth First Search and Planarity
  8. Topic II: Depth First Search and Nonplanarity
  9. Topic III: Triconnectivity
  10. Topic IV: Matroids
  References for Graphs, Trees, and Recursions
  Index