Combinatorics for Computer Science

by S. Gill Williamson

Synopsis of Combinatorics for Computer Science

Useful guide covers two major subdivisions of combinatorics — enumeration and graph theory — with emphasis on conceptual needs of computer science. Each part is divided into a "basic concepts" chapter emphasizing intuitive needs of the subject, followed by four "topics" chapters that explore these ideas in depth. Includes 219 figures.

Booknews

A textbook for a beginning graduate course for students majoring in mathematics or computer science. It uses combinatorial mathematics to teach basic techniques of proof. The 1985 edition was published by Computer Science Press, Rockville, Maryland. Annotation c. Book News, Inc., Portland, OR (booknews.com)

Reviews of Combinatorics for Computer Science

More Books in this Genre

Graphs on Surfaces and Their Applications
by Sergei K. Lando, Alexander K. Zvonkin, R.V. Gamkrelidze

Topics in Algebraic Graph Theory
by Lowell W. Beineke, Robin J. Wilson (Editor), Peter J. Cameron

A Guide to Monte Carlo Simulations in Statistical Physics
by David P. Landau, Kurt Binder

102 Combinatorial Problems
by Titu Andreescu, Zuming Feng

Algebraic Graph Theory
by Chris D. Godsil, C. D. Godsil, Gordon Royle

Graph Theory
by Reinhard Diestel

Algebraic Combinatorics on Words
by M. Lothaire, Lothaire M, Jean Berstel

Monte Carlo Methods in Statistical Physics
by M. E. J. Newman, G. T. Barkema

Bayesian Models for Categorical Data
by Peter Congdon

Likelihood, Bayesian and MCMC Methods in Quantitative Genetics
by Daniel Sorensen, Daniel Gianola

The Theory of Graphs
by Claude Berge

A Classical Introduction to Cryptography Exercise Book
by Thomas Baigneres, Pascal Junod, Yi Lu

Sections

• Details
• Synopsis
• Topics
• Books.org Reviews

Follow Us

Browse Books by Subject