scientific article; zbMATH DE number 193641

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Review text

A well-written undergraduate textbook for a today computer science curriculum on combinatorial and algebraic topics of general interest, stressing construction of algorithms and discussion of its running time. There are many concrete examples, a thousand exercises (solutions or hints for odd one are given), and many figures to illustrate treated topics. Chapters 1, 2, 3, 4, 7 contain the core of material on sets, logic, functions, relations and baby algebra; chapter 5 contains counting techniques, chapter 8 graphs and graph algorithms, chapter 9 trees (with, e.g., depth first search algorithms), chapter 10 Boolean algebra (to Karnaugh maps), chapter 11 a bit of group theory with applications to counting. A two-semester course can cover the whole book, various choices of topics are possible for a one-semester course. Coordinating the choice with computer science courses is strongly recommended: the interactive material is enormous.

Cited in

(51)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4040446)