Combinatorics for Computer Science

Front Cover
Courier Corporation, Jan 1, 2002 - Mathematics - 479 pages
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. Invaluable practical resource for graduate students, advanced undergraduates, and professionals with an interest in algorithm design and other aspects of computer science and combinatorics. References for Linear Order & for Graphs, Trees, and Recursions. 219 figures.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

BASIC CONCEPTS OF LINEAR ORDER
3
TOPIC I SORTING
47
BASIC COMBINATORIAL LISTS
76
4
98
SYMMETRYORBIT ENUMERATION
114
A TRIANGLE
120
We explore some less obvious variations on Burnsides lemma 4 224
128
SOME CLASSICAL COMBINATORICS
165
5B THE PRINCIPLE OF INCLUSIONEXCLUSION
182
5C MOBIUS INVERSION
188
FLOW THROUGH A NETWORK
201
8
263
DEPTH FIRST SEARCH
319
TRICONNECTIVITY
337
MATROIDS
359
References for Graphs Trees and Recursion
450

2 integral partitions with no repeated parts and
171
NotAtion FOR THE MULTINOMIAL COEFFICIENT
173
COROLLARY uniqueness of normalized basis sequence
179

Other editions - View all

Common terms and phrases

About the author (2002)

Williamson was Professor of Mathematics at the University of California, San Diego, from 1965 to 1991, and has been Professor of Computer Science at the University of California, San Diego, from 1991 to present.

Bibliographic information