|
![]() |
|||
|
||||
OverviewThis is a text with more than enough material for a one-semester introduction to combinatorics. The original target audience was primarily computer science majors, but the topics included make it suitable for a variety of different students. Topics include Basic enumeration: strings, sets, binomial coefficients Recursion and mathematical induction Graph theory Partially ordered sets Additional enumeration techniques: inclusion-exclusion, generating functions, recurrence relations, and Polya theory. Graph algorithms: minimum weight spanning trees, Dijkstra's algorithm, network flows This text is open source and available under a Creative Commons license. To access the free HTML and PDF versions of the text, visit http: //rellek.net/appcomb/. Full Product DetailsAuthor: Professor William T Trotter , Mitchel T KellerPublisher: Createspace Independent Publishing Platform Imprint: Createspace Independent Publishing Platform Dimensions: Width: 18.90cm , Height: 2.00cm , Length: 24.60cm Weight: 0.686kg ISBN: 9781534878655ISBN 10: 1534878653 Pages: 384 Publication Date: 23 June 2016 Audience: General/trade , General Format: Paperback Publisher's Status: Active Availability: Available To Order ![]() We have confirmation that this item is in stock with the supplier. It will be ordered in for you and dispatched immediately. Table of ContentsReviewsAuthor InformationMitchel T. Keller is an Assistant Professor of Mathematics at Washington and Lee University in Lexington, Virginia. William T. Trotter is a Professor of Mathematics at the Georgia Institute of Technology in Atlanta. Tab Content 6Author Website:Countries AvailableAll regions |