
Topics in Algorithmic Graph Theory
- English
- PDF
- Available on iOS & Android
Topics in Algorithmic Graph Theory
About this book
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.
Frequently asked questions
- Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
- Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Information
Table of contents
- Cover
- Half-title
- Series information
- Frontispiece
- Title page
- Copyright information
- Contents
- Foreword by Martin Charles Golumbic
- Preface
- Preliminaries
- 1 Graph algorithms
- 2 Graph colouring variations
- 3 Total colouring
- 4 Testing of graph properties
- 5 Cliques, colouring and satisfiability: from structure to algorithms
- 6 Chordal graphs
- 7 Dually and strongly chordal graphs
- 8 Leaf powers
- 9 Split graphs
- 10 Strong cliques and stable sets
- 11 Restricted matchings
- 12 Covering geometric domains
- 13 Graph homomorphisms
- 14 Sparsity and model theory
- 15 Extremal vertex-sets
- Notes on contributors
- Index