Lists, Decisions, and Graphs
by Edward A. Bender, S. Gill Williamson
Publisher: University of California, San Diego 2010
Number of pages: 261
Description:
In this book, four basic areas of discrete mathematics are presented: Counting and Listing (Unit CL), Functions (Unit Fn), Decision Trees and Recursion (Unit DT), and Basic Concepts in Graph Theory (Unit GT). At the end of each unit is a list of Multiple Choice Questions for Review.
Download or read it online for free here:
Download link
(2.1MB, PDF)
Download mirrors:
Mirror 1
Similar books

by A.F. Pixley - Harvey Mudd College
This text is an introduction to a selection of topics in discrete mathematics: Combinatorics; The Integers; The Discrete Calculus; Order and Algebra; Finite State Machines. The prerequisites include linear algebra and computer programming.
(7589 views)

by Edward A. Bender, S. Gill Williamson - Dover Publications
This text assists undergraduates in mastering the mathematical language to address problems in the field's many applications. It consists of 4 units: counting and listing, functions, decision trees and recursion, and basic concepts of graph theory.
(27426 views)

by M. Desbrun, P. Schroeder, M. Wardetzky - Columbia University
This new and elegant area of mathematics has exciting applications, as this text demonstrates by presenting practical examples in geometry processing (surface fairing, parameterization, and remeshing) and simulation (of cloth, shells, rods, fluids).
(11772 views)

by Petter Holme, Jari Saramäki - arXiv
In this review, the authors present the emergent field of temporal networks, and discuss methods for analyzing topological and temporal structure and models for elucidating their relation to the behavior of dynamic systems.
(8937 views)