书目名称 | Constructive Combinatorics | 编辑 | Dennis Stanton,Dennis White | 视频video | | 丛书名称 | Undergraduate Texts in Mathematics | 图书封面 |  | 描述 | 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 con | 出版日期 | Textbook 1986 | 关键词 | Combinatorics; Graph theory; Lattice; Matching; Partition; Permutation; algorithms; enumerative combinatori | 版次 | 1 | doi | https://doi.org/10.1007/978-1-4612-4968-9 | isbn_softcover | 978-0-387-96347-1 | isbn_ebook | 978-1-4612-4968-9Series ISSN 0172-6056 Series E-ISSN 2197-5604 | issn_series | 0172-6056 | copyright | Springer-Verlag New York Inc. 1986 |
The information of publication is updating
|
|