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 (spanning trees, connectivity, genus, colourability, flows in networks, matchings and traversals) and covers many of the major classical theorems, the emphasis is on algorithms and thier complexity: which graph problems have known efficient solutions and which are intractable. For the intractable problems a number of efficient approximation algorithms are included with known performance bounds. Informal use is made of a PASCAL-like programming language to describe the algorithms. A number of exercises and outlines of solutions are included to extend and motivate the material of the text.
FREE Two-Day Shipping for students on millions of items. Learn more |
| ||||||||||||||||||
Book Description
Editorial Reviews
Review
"...judiciously written...a good text..." SIAM Review
Book Description
This introduction to most of the classical concepts of pure and applied graph theory covers many of the major classical theorems. The emphasis is on algorithms and their complexity--what graph problems have known efficient solutions and which are intractable.
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
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
First Sentence:
In this chapter we introduce the basic language of graph theory and of algorithmic complexity. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
simple planar graph, augmentation path, labelled outer, postman problem, augmenting path, planarity testing algorithm, proper colouring, maximum branching, plane triangulation, subgraph homeomorphic, free vertex, unavoidable set, free vertices, edge disjoint paths, dominating set, reducible configurations, slackness conditions, vertex disjoint paths, alternating path, repeated edges, chromatic polynomials, fundamental circuits, travelling salesman problem, adjacency lists, tape cells Key Phrases - Capitalized Phrases (CAPs): (learn more)
Computer Science Press, Academic Press, Marcel Dekker, Princeton University Press, Selected Topics New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
In this chapter we introduce the basic language of graph theory and of algorithmic complexity. Read the first page Key Phrases - Statistically Improbable Phrases (SIPs): (learn more)
simple planar graph, augmentation path, labelled outer, postman problem, augmenting path, planarity testing algorithm, proper colouring, maximum branching, plane triangulation, subgraph homeomorphic, free vertex, unavoidable set, free vertices, edge disjoint paths, dominating set, reducible configurations, slackness conditions, vertex disjoint paths, alternating path, repeated edges, chromatic polynomials, fundamental circuits, travelling salesman problem, adjacency lists, tape cells Key Phrases - Capitalized Phrases (CAPs): (learn more)
Computer Science Press, Academic Press, Marcel Dekker, Princeton University Press, Selected Topics New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 15
books:
See all 15 books this book cites
72
books
cite this book:
See all 72 books citing this book
- Graph Algorithms (Computer Software Engineering Series) by Shimon Even on 5 pages
- Selected Topics in Graph Theory by Lowell W. Beineke on page 93, page 184, and page 211
- Graph Theory With Applications by John Adrian Bondy on page 63, page 93, and page 211
- Graph Theory (Graduate Texts in Mathematics) by Reinhard Diestel on page 63, page 93, and page 211
- The Theory of Graphs (Dover Books on Mathematics) by Claude Berge on page 63, and page 93
See all 15 books this book cites
- Mechanisms, Symbols, and Models Underlying Cognition: First International Work-Conference on the Interplay Between Natural and Artificial Computation, ... Computer Science and General Issues) by José Mira on page 299, and page 309
- Efficient Parallel Algorithms by Alan Gibbons on page 86, and page 255
- A Beginner's Guide to Graph Theory by W.D. Wallis in Back Matter
- Automata, Languages and Programming: 20th International Colloquium, ICALP 93, Lund, Sweden, July 5-9, 1993. Proceedings (Lecture Notes in Computer Science) by Andrzej Lingas on page 101
- Sociological Methodology (Volume 31, 2001) by Michael E. Sobel on page 357
See all 72 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
|
