Topics in algorithmic graph theory
Author(s)
Bibliographic Information
Topics in algorithmic graph theory
（Encyclopedia of mathematics and its applications / edited by G.-C. Rota, 178）
Cambridge University Press, 2021
- : hardback
Related Bibliography 1 items
Available at / 10 libraries
-
No Libraries matched.
- Remove all filters.
Note
Differs from <BC04294783> in statement of responsibility
Includes bibliographical references and index
Description and Table of Contents
Description
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.
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 Brandstadt and Martin Charles Golumbic
- 8. Leaf Powers Christian Rosenke, Van Bang Le and Andreas Brandstadt
- 9. Split Graphs Karen L. Collins and Ann N. Trenk
- 10. Strong Cliques and Stable Sets Martin Milanic
- 11. Restricted Matchings Maximilian Furst and Dieter Rautenbach
- 12. Covering Geometric Domains Gila Morgenstern
- 13. Graph Homomorphisms Pavol Hell and Jaroslav Nesetril
- 14. Sparsity and Model Theory Patrice Ossona de Mendez
- 15. Extremal Vertex-sets Serge Gaspers
- Notes on Contributors
- Index.
by "Nielsen BookData"