This adaptation of an earlier work by the authors is a graduate text and professional reference on the fundamentals of graph theory. It covers the theory of graphs, its applications to computer networks and the theory of graph algorithms. Also includes exercises and an updated bibliography.
FREE Two-Day Shipping for Students. Learn more |
Book Description
Special Offers and Product Promotions
- Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)
Editorial Reviews
From the Publisher
This adaptation of an earlier work by the authors is a graduate text and professional reference on the fundamentals of graph theory. It covers the theory of graphs, its applications to computer networks and the theory of graph algorithms. Also includes exercises and an updated bibliography.
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most Helpful Customer Reviews
0 of 9 people found the following review helpful:
3.0 out of 5 stars
good book for graph theory and algoritms,
By ravi (america) - See all my reviews
This review is from: Graphs: Theory and Algorithms (Hardcover)
this book has all the fundamental algorithms on graph problems and is written in a easy to understand manner
Share your thoughts with other customers: Create your own review
|
|
Inside This Book
(learn more)
First Sentence:
We begin our study with an introduction in this chapter to several basic concepts in theory of graphs. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
circuit subspace, cutset subspace, cutset vector, cospanning tree, label preflow push algorithm, cocircuit matrix, dark green element, maximum weight member, fundamental cocircuit, augmenting path relative, nonsaturating pushes, fundamental cutset with respect, fundamental circuit matrix, fundamental cutset matrix, nonnull intersection, relabel operation, augmentation theorem, same edge order, residual edge, weighted connected graph, virtual vertices, optimum branching, fundamental outsets, maximum flow algorithm, nonseparable graph Key Phrases - Capitalized Phrases (CAPs): (learn more)
New York, Englewood Cliffs, Combinatorial Theory, Academic Press, London Math, Technical Report, Pacific Grove, Proof Necessity Let, Sufficiency Suppose, Stanford University, Derive Hall, Information Processing Lett, Proof Necessity Suppose, Soviet Math, Springer Verlag, Sufficiency Let, Theory of Computing, Acta Informatica, Annual Symp, Bapeswara Rao, Cambridge Phil, Combinatorial Mathematics, Discrete Math, Rinnooy Kan, San Francisco New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Back Cover | Surprise Me!
We begin our study with an introduction in this chapter to several basic concepts in theory of graphs. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
circuit subspace, cutset subspace, cutset vector, cospanning tree, label preflow push algorithm, cocircuit matrix, dark green element, maximum weight member, fundamental cocircuit, augmenting path relative, nonsaturating pushes, fundamental cutset with respect, fundamental circuit matrix, fundamental cutset matrix, nonnull intersection, relabel operation, augmentation theorem, same edge order, residual edge, weighted connected graph, virtual vertices, optimum branching, fundamental outsets, maximum flow algorithm, nonseparable graph Key Phrases - Capitalized Phrases (CAPs): (learn more)
New York, Englewood Cliffs, Combinatorial Theory, Academic Press, London Math, Technical Report, Pacific Grove, Proof Necessity Let, Sufficiency Suppose, Stanford University, Derive Hall, Information Processing Lett, Proof Necessity Suppose, Soviet Math, Springer Verlag, Sufficiency Let, Theory of Computing, Acta Informatica, Annual Symp, Bapeswara Rao, Cambridge Phil, Combinatorial Mathematics, Discrete Math, Rinnooy Kan, San Francisco New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Back Cover | Surprise Me!
Citations (learn more)
This book cites 48
books:
See all 48 books this book cites
12
books
cite this book:
See all 12 books citing this book
- Graph Theory (Cambridge Mathematical Library) by W. T. Tutte on 8 pages
- Graph Theory (Graduate Texts in Mathematics) by Reinhard Diestel on 8 pages
- Graph Theory With Applications by John Adrian Bondy on 6 pages
- Introduction to Graph Theory (4th Edition) by Robin J. Wilson on 4 pages
- Introduction to Combinatorial Mathematics (Computer Science Series) by Chung L. Liu on page 30, page 70, and page 263
See all 48 books this book cites
- Graph Theory and Its Applications by Jonathan L. Gross in Back Matter (1), Back Matter (2), and Back Matter (3)
- Mathematics for Circuits and Filters by Wai-Kai Chen on page 242, and page 255
- Broadband Networking ATM, ADH and SONET (Artech House Telecommunications Library) by Mike Sexton on page 111, and page 375
- Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics) by Bernhard Korte on page 182
- Artificial Life Models in Software by Andrew Adamatzky on page 185
See all 12 books citing this book
Books on Related Topics
(learn more)
|
Tags Customers Associate with This Product(What's this?)Click on a tag to find related items, discussions, and people.
|
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
