|
|
Sold Out
Book Categories |
Preface;
1. Introducing graphs and algorithmic complexity;
2. Spanning-trees, branchings and connectivity;
3. Planar graphs;
4. Networks and flows;
5. Matchings;
6. Eulerian and Hamiltonian tours;
7. Colouring graphs;
8. Graph problems and intractability; Appendix; Author Index; Subject Index.
| Price | Condition | Delivery | Seller | Action |
| $99.99 | Digital |
| WonderClub |
Susan Purnell
reviewed Algorithmic Graph Theory on February 22, 2017
Algorithmic Graph Theory
If you read this book as first time in order to understand Computational Complexity, then you're probably not going to like it. You need to read Sipser's textbook before you read this book and make sure that you have a strong background in discrete mathematics (if not, then see Rosen's textbook in Discrete Mathematics). This book is recommended by best people in complexity and algorithms such as Scott Aaronson, Sipser, etc. You need to solve as many exercises as you go.
The book has five parts:
Part I: Algorithms
Part II: Logic
Part III: P and NP
Part IV: Inside P
Part V: Beyond NP
The most important parts are in Part I, III.
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish List
X
This item is in your Collection
Algorithmic Graph Theory
X
This Item is in Your Inventory
Algorithmic Graph Theory
X
You must be logged in to review the productsX
X
X
Add Algorithmic Graph Theory, This is a textbook on graph theory, especially suitable for computer scientists but also suitable for mathematicians with an interest in computational complexity. Although it introduces most of the classical concepts of pure and applied graph theory (span, Algorithmic Graph Theory to the inventory that you are selling on WonderClubX
X
Add Algorithmic Graph Theory, This is a textbook on graph theory, especially suitable for computer scientists but also suitable for mathematicians with an interest in computational complexity. Although it introduces most of the classical concepts of pure and applied graph theory (span, Algorithmic Graph Theory to your collection on WonderClub |