Visit our Christmas Gift Finder
Constructive Combinatorics - Undergraduate Texts in Mathematics (Paperback)
  • Constructive Combinatorics - Undergraduate Texts in Mathematics (Paperback)
zoom

Constructive Combinatorics - Undergraduate Texts in Mathematics (Paperback)

(author), (author)
£54.99
Paperback 186 Pages / Published: 15/05/1986
  • We can order this

Usually dispatched within 3 weeks

  • This item has been added to your basket
The notes that eventually became this book were written between 1977 and 1985 for the course called Constructive Combinatorics at the University of Minnesota. This is a one-quarter (10 week) course for upper level undergraduate students. The class usually consists of mathematics and computer science majors, with an occasional engineering student. Several graduate students in computer science also attend. At Minnesota, Constructive Combinatorics is the third quarter of a three quarter sequence. The fIrst quarter, Enumerative Combinatorics, is at the level of the texts by Bogart [Bo], Brualdi [Br], Liu [Li] or Tucker [Tu] and is a prerequisite for this course. The second quarter, Graph Theory and Optimization, is not a prerequisite. We assume that the students are familiar with the techniques of enumeration: basic counting principles, generating functions and inclusion/exclusion. This course evolved from a course on combinatorial algorithms. That course contained a mixture of graph algorithms, optimization and listing algorithms. The computer assignments generally consisted of testing algorithms on examples. While we felt that such material was useful and not without mathematical content, we did not think that the course had a coherent mathematical focus. Furthermore, much of it was being taught, or could have been taught, elsewhere. Graph algorithms and optimization, for instance, were inserted into the graph theory course where they naturally belonged. The computer science department already taught some of the material: the simpler algorithms in a discrete mathematics course; effIciency of algorithms in a more advanced course.

Publisher: Springer-Verlag New York Inc.
ISBN: 9780387963471
Number of pages: 186
Weight: 1030 g
Dimensions: 235 x 155 x 12 mm
Edition: 1986 ed.

You may also be interested in...

Problems in Probability
Added to basket
Principia Mathematica - Volume One
Added to basket
Proofs and Fundamentals
Added to basket
Discrete Mathematics
Added to basket
Introduction to Graph Theory
Added to basket
A Geometrical Picture Book
Added to basket
Proofs from THE BOOK
Added to basket
A Combinatorial Introduction to Topology
Added to basket

Please sign in to write a review

Your review has been submitted successfully.