Notes on Introductory Combinatorics

Developed from the authors<U+0019> introductory combinatorics course, this book focuses on a branch of mathematics which plays a crucial role in computer science. Combinatorial methods provide many analytical tools used for determining the expected performance of computer algorithms. Elementar...

Full description

Bibliographic Details
Main Authors: Pl̤ya, George. (Author), Tarjan, Robert E. (Author), Woods, Donald R. (Author)
Corporate Author: SpringerLink (Online service)
Format: Electronic
Language:English
Published: Boston : Birkhũser Boston, 2010.
Edition:1st.
Series:Modern Birkhũser Classics
Subjects:
Online Access:https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-0-8176-4953-1
LEADER 04153nam a22005655i 4500
001 8446
003 DE-He213
005 20131108171156.0
007 cr nn 008mamaa
008 100301s2010 xxu| s |||| 0|eng d
020 # # |a 9780817649531  |9 978-0-8176-4953-1 
024 7 # |a 10.1007/978-0-8176-4953-1  |2 doi 
050 # 4 |a QA164-167.2 
072 # 7 |a PBV  |2 bicssc 
072 # 7 |a MAT036000  |2 bisacsh 
082 0 4 |a 511.6  |2 23 
100 1 # |a Pl̤ya, George.  |e author. 
245 1 0 |a Notes on Introductory Combinatorics  |c by George Pl̤ya, Robert E. Tarjan, Donald R. Woods.  |h [electronic resource] / 
250 # # |a 1st. 
264 # 1 |a Boston :  |b Birkhũser Boston,  |c 2010. 
300 # # |a XII, 192 p. 125 illus.  |b online resource. 
336 # # |a text  |b txt  |2 rdacontent 
337 # # |a computer  |b c  |2 rdamedia 
338 # # |a online resource  |b cr  |2 rdacarrier 
347 # # |a text file  |b PDF  |2 rda 
490 1 # |a Modern Birkhũser Classics 
505 0 # |a Introduction -- Combinations and Permutations -- Generating Functions -- Principle of Inclusion and Exclusion -- Stirling Numbers -- Pl̤ya's Theory of Counting -- Outlook -- Midterm Examination -- Ramsey Theory -- Matchings (Stable Marriages) -- Matchings (Maximum Matchings) -- Network Flow -- Hamiltonian and Eulerian Paths -- Planarity and the Four-Color Theorem -- Final Examination -- Bibliography. 
520 # # |a Developed from the authors<U+0019> introductory combinatorics course, this book focuses on a branch of mathematics which plays a crucial role in computer science. Combinatorial methods provide many analytical tools used for determining the expected performance of computer algorithms. Elementary subjects such as combinations and permutations, and mathematical tools such as generating functions and Pl̤ya<U+0019>s Theory of Counting, are covered, as are analyses of specific problems such as Ramsey Theory, matchings, and Hamiltonian and Eulerian paths. This introduction will provide students with a solid foundation in the subject. ---- "This is a delightful little paperback which presents a day-by-day transcription of a course taught jointly by Pl̤ya and Tarjan at Stanford University. Woods, the teaching assistant for the class, did a very good job of merging class notes into an interesting mini-textbook; he also included the exercises, homework, and tests assigned in the class (a very helpful addition for other instructors in the field). The notes are very well illustrated throughout and Woods and the Birkhũser publishers produced a very pleasant text. One can count on [Pl̤ya and Tarjan] for new insights and a fresh outlook. Both instructors taught by presenting a succession of examples rather than by presenting a body of theory&[The book] is very well suited as supplementary material for any introductory class on combinatorics; as such, it is very highly recommended. Finally, for all of us who like the topic and delight in observing skilled professionals at work, this book is entertaining and, yes, instructive, reading." <U+0014>Mathematical Reviews (Review of the original hardcover edition) "The mathematical community welcomes this book as a final contribution to honour the teacher G. Pl̤ya." <U+0014>Zentralblatt MATH (Review of the original hardcover edition) 
650 # 0 |a Mathematics. 
650 # 0 |a Computer software. 
650 # 0 |a Electronic data processing. 
650 # 0 |a Computer science  |x Mathematics. 
650 # 0 |a Algorithms. 
650 # 0 |a Combinatorics. 
650 1 4 |a Mathematics. 
650 2 4 |a Combinatorics. 
650 2 4 |a Algorithms. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Computational Mathematics and Numerical Analysis. 
650 2 4 |a Numeric Computing. 
700 1 # |a Tarjan, Robert E.  |e author. 
700 1 # |a Woods, Donald R.  |e author. 
710 2 # |a SpringerLink (Online service) 
773 0 # |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9780817649524 
830 # 0 |a Modern Birkhũser Classics 
856 4 0 |u https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-0-8176-4953-1 
912 # # |a ZDB-2-SMA 
950 # # |a Mathematics and Statistics (Springer-11649)