Minecraft Adventures B2G1 Free
 
 

Special Offers see all

Enter to WIN a $100 Credit

Subscribe to PowellsBooks.news
for a chance to win.
Privacy Policy

Visit our stores


    Recently Viewed clear list


    Original Essays | August 14, 2015

    Roxanne Dunbar-Ortiz: IMG The Blind Spot of United States History



    The most frequent question readers ask about An Indigenous Peoples' History of the United States is "Why hasn't this book been written before?" I'm... Continue »
    1. $11.20 Sale Trade Paper add to wish list

    spacer

This item may be
out of stock.

Click on the button below to search for this title in other formats.


Check for Availability
Add to Wishlist

Combinatorics for Computer Science (Dover Books on Mathematics)

Combinatorics for Computer Science (Dover Books on Mathematics) Cover

 

Synopses & Reviews

Publisher Comments:

While the mathematics of classical engineering and science is primarily "continuous, " the mathematics of computer science is primarily "discrete" or "combinatorial." This volume provides a useful guide to combinatorial mathematics for computer scientists and applied mathematicians. Based on a beginning graduate-level course taught by the author, it covers the two major subdivisions of combinatorics, enumeration and graph theory, with emphasis on the conceptual needs of computer science. Each part is divided into a "basic concepts" chapter that emphasizes the intuitive ideas of the subject, followed by four "topics" chapters that explore these ideas in depth. Given the rapid and continued growth of computer science today, this accessible, well-written volume will be an invaluable practical resource for graduate students, advanced undergraduates, and professionals with an interest in algorithm design and other aspects of computer science and combinatorics.

Book News Annotation:

A textbook for a beginning graduate course for students majoring in mathematics or computer science. It uses combinatorial mathematics to teach basic techniques of proof. The 1985 edition was published by Computer Science Press, Rockville, Maryland.
Annotation c. Book News, Inc., Portland, OR (booknews.com)

Synopsis:

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.

Synopsis:

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. Invaluable practical resource for graduate students, advanced undergraduates, and professionals with an interest in algorithm design and other aspects of computer science and combinatorics. References for Linear Order & for Graphs, Trees, and Recursions. 219 figures.

Table of Contents

  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

Product Details

ISBN:
9780486420769
Author:
Williamson, S. Gill
Publisher:
Dover Publications
Location:
Mineola, N.Y.
Subject:
Computer Science
Subject:
Applied
Subject:
Combinatorial analysis
Subject:
Combinatorics
Subject:
General Mathematics
Edition Description:
Trade Paper
Series:
Dover Books on Mathematics
Series Volume:
v. 17
Publication Date:
20020508
Binding:
Electronic book text in proprietary or open standard format
Language:
English
Illustrations:
219 figures
Pages:
523
Dimensions:
8.5 x 5.38 in 1.25 pd

Related Subjects

Science and Mathematics » Mathematics » Advanced
Science and Mathematics » Mathematics » Combinatorics

Combinatorics for Computer Science (Dover Books on Mathematics)
0 stars - 0 reviews
$ In Stock
Product details 523 pages Dover Publications - English 9780486420769 Reviews:
"Synopsis" by ,
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.

"Synopsis" by ,
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. Invaluable practical resource for graduate students, advanced undergraduates, and professionals with an interest in algorithm design and other aspects of computer science and combinatorics. References for Linear Order & for Graphs, Trees, and Recursions. 219 figures.
spacer
spacer
  • back to top

FOLLOW US ON...

       
Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and gifts — here at Powells.com.