Bargain BinAfrican-American History M......American History, American......American IndiansAntiquesArchitectureArtArt Activity PacksBrain GamesBestsellersBooks Under $10Bridge and Other Card Game......Business and EconomicsCalla EditionsChessChildrenCivil War BooksClip Art and Design on CD-......Clip Art in Books (Pictori......Coloring BooksCookbooks, NutritionCraftsCreative HomeownerDesignWorksDetective, Ghost , Superna......Dover Discovery KitsDover Fun KitsDover Pocket PuzzlesEmpower Your LifeEthnic InterestFeaturesGift CertificatesGift IdeasGoing GreenHistory, Political Science......HolidaysHumorI Can Draw SetsLanguages and LinguisticsLiteratureMagic, LegerdemainMilitary History, Weapons ......MusicNASA Historical SeriesNatureOccult and Esoteric Studie......OrigamiPaper DollsPerforming Arts, Drama, Fi......Philosophy and ReligionPhotographyPostersPrincess LeonoraPsychology, EducationPuzzles, Amusement, Recrea......REA - Research & Education......Science and MathematicsSesame StreetShakespeare ShopSociology, Anthropology, M......SpaceSports, Out-of-Door Activi......Stained Glass Coloring Fun......Stained Glass Coloring Kit......Stationery, Seasonal Books......Teacher's StoreTravel and AdventureWomen's StudiesEditors' PicksMcCain & Obama Paper Dolls......WoodworkingSaturday Saver

Combinatorics for Computer Science by S. Gill Williamson ISBN: 0486420760 Dover Publications Price: $22.95 click here to see this book 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. Includes 219 figures. Unabridged republication of original 1985 edition. References for Linear Order & for Graphs, Trees, and Recursions. Table of Contents for Combinatorics for Computer Science Preface Acknowledgments Suggestions on How to Use This Book Study Guide for Part I: Linear Order Study Guide for Part II: Graphs, Trees, and Recursion Part I. Linear Order 1. Basic concepts of Linear Order 2. Topic I: Sorting 3. Topic II: Basic Combinatorial Lists 4. Topic III: Symmetry--Orbit Enumeration and Orderly Algorithms 5. Topic IV: Some Classic Combinatorics A. Generating Functions B. The Principle of Inclusion-Exclusion C. Möbius Inversion D. Network Flows References for Linear Order Part II. Graphs, Trees, and Recursion 6. Basic Concepts of Graphs, Trees, and Recursion 7. Topic I: Depth First Search and Planarity 8. Topic II: Depth First Search and Nonplanarity 9. Topic III: Triconnectivity 10. Topic IV: Matroids References for Graphs, Trees, and Recursions Index

Join the Dover Family | Track Your Order | Your Account | Shipping Rates and Policies | Returns | Customer Service | Free Samples | About Dover | Privacy Notice | Terms of Use | Join Our Staff | Free Catalogs