Topics in Algorithmic Graph Theory
Part of Encyclopedia of Mathematics and its Applications
- Editors:
- Lowell W. Beineke, Purdue University, Indiana
- Martin Charles Golumbic, University of Haifa, Israel
- Robin J. Wilson, The Open University, Milton Keynes
- Date Published: June 2021
- availability: Available
- format: Hardback
- isbn: 9781108492607
Hardback
Other available formats:
eBook
Looking for an inspection copy?
This title is not currently available on inspection
-
Algorithmic graph theory has been expanding at an extremely rapid rate since the middle of the twentieth century, in parallel with the growth of computer science and the accompanying utilization of computers, where efficient algorithms have been a prime goal. This book presents material on developments on graph algorithms and related concepts that will be of value to both mathematicians and computer scientists, at a level suitable for graduate students, researchers and instructors. The fifteen expository chapters, written by acknowledged international experts on their subjects, focus on the application of algorithms to solve particular problems. All chapters were carefully edited to enhance readability and standardize the chapter structure as well as the terminology and notation. The editors provide basic background material in graph theory, and a chapter written by the book's Academic Consultant, Martin Charles Golumbic (University of Haifa, Israel), provides background material on algorithms as connected with graph theory.
Read more- Timely coverage of the rapidly expanding area of algorithmic graph theory
- Written by world leaders in the field, with authors from eleven countries and five continents
- Provides extensive background material and gives detailed references for each chapter
- Covers the main areas of the subject, using a consistent chapter structure, terminology and notation throughout
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: June 2021
- format: Hardback
- isbn: 9781108492607
- length: 364 pages
- dimensions: 241 x 162 x 25 mm
- weight: 0.68kg
- availability: Available
Table of Contents
Foreword Martin Charles Golumbic
Preface Lowell W. Beineke and Robin J. Wilson
Preliminaries Lowell W. Beineke, Martin Charles Golumbic and Robin J. Wilson
1. Graph Algorithms Martin Charles Golumbic
2. Graph Colouring Variations Alain Hertz and Bernard Ries
3. Total Colouring Celina M. H. de Figueiredo
4. Testing of Graph Properties Ilan Newman
5. Cliques, Colouring and Satisfiability: From Structure to Algorithms Vadim Lozin
6. Chordal Graphs Martin Charles Golumbic
7. Dually and Strongly Chordal Graphs Andreas Brandstädt and Martin Charles Golumbic
8. Leaf Powers Christian Rosenke, Van Bang Le and Andreas Brandstädt
9. Split Graphs Karen L. Collins and Ann N. Trenk
10. Strong Cliques and Stable Sets Martin Milanič
11. Restricted Matchings Maximilian Fü rst and Dieter Rautenbach
12. Covering Geometric Domains Gila Morgenstern
13. Graph Homomorphisms Pavol Hell and Jaroslav Neš etř il
14. Sparsity and Model Theory Patrice Ossona de Mendez
15. Extremal Vertex-sets Serge Gaspers
Notes on Contributors
Index.
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×