Skip to content
Register Sign in Wishlist

Topics in Algorithmic Graph Theory

Part of Encyclopedia of Mathematics and its Applications

Lowell W. Beineke, Martin Charles Golumbic, Robin J. Wilson, Alain Hertz, Bernard Ries, Celina M. H. de Figueiredo, Ilan Newman, Vadim Lozin, Andreas Brandstädt, Christian Rosenke, Van Bang Le, Karen L. Collins, Ann N. Trenk, Martin Milanič, Maximilian Fürst, Dieter Rautenbach, Gila Morgenstern, Pavol Hell, Jaroslav Nešetřil, Patrice Ossona de Mendez, Serge Gaspers
View all contributors
  • Date Published: June 2021
  • availability: Available
  • format: Hardback
  • isbn: 9781108492607

Hardback

Add to wishlist

Other available formats:
eBook


Looking for an inspection copy?

This title is not currently available on inspection

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • 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.

    • 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
    Read more

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    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.

  • Editors

    Lowell W. Beineke, Purdue University, Indiana
    Lowell W. Beineke is the Jack W. Schrey Professor Emeritus of Mathematics at Purdue University Fort Wayne. He has written over a hundred papers in graph theory and has served as Editor of The College Mathematics Journal. In addition to four previous volumes in this series, Robin Wilson and he have jointly edited five other books in the field. Recent honours include having an award of the College of Arts and Sciences at his university named after him, being entered into the Purdue University Book of Great Teachers, and receiving a Meritorious Service award from the Mathematical Association of America. He also received a Lifetime Service Award from Who's Who in America.

    Martin Charles Golumbic, University of Haifa, Israel
    Martin Charles Golumbic is an Emeritus Professor of Computer Science at the University of Haifa and founder of the Caesarea Edmond Benjamin de Rothschild Institute for Interdisciplinary Applications of Computer Science. He is the founding Editor-in-Chief of the journal Annals of Mathematics and Artificial Intelligence. The books he has written include Algorithmic Graph Theory and Perfect Graphs, Tolerance Graphs (with Ann Trenk), Fighting Terror Online: The Convergence of Security, Technology, and the Law and The Zeroth Book of Graph Theory: An Annotated Translation of Les Réseaux (ou Graphes) by André Sainte-Laguë. He is a Foundation Fellow of the Institute of Combinatorics and its Applications, a Fellow of the European Artificial Intelligence society EurAI, and a member of the Academia Europaea, honoris causa.

    Robin J. Wilson, The Open University, Milton Keynes
    Robin J. Wilson is an Emeritus Professor of Pure Mathematics at the Open University, UK, and of Geometry at Gresham College, London, and is a former Fellow of Keble College, Oxford. He has written and edited over forty books on graph theory, combinatorics and the history of mathematics, including Introduction to Graph Theory and Four Colours Suffice. A former President of the British Society for the History of Mathematics, he has won prizes from the Mathematical Association of America for his expository writing and was awarded the 2017 Stanton Medal of the Institute of Combinatorics and its Applications for his outreach activities in combinatorics.

    Contributors

    Lowell W. Beineke, Martin Charles Golumbic, Robin J. Wilson, Alain Hertz, Bernard Ries, Celina M. H. de Figueiredo, Ilan Newman, Vadim Lozin, Andreas Brandstädt, Christian Rosenke, Van Bang Le, Karen L. Collins, Ann N. Trenk, Martin Milanič, Maximilian Fürst, Dieter Rautenbach, Gila Morgenstern, Pavol Hell, Jaroslav Nešetřil, Patrice Ossona de Mendez, Serge Gaspers

Related Books

also by this author

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
Please note that this file is password protected. You will be asked to input your password on the next screen.

» 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 ×

Continue ×

Continue ×
warning icon

Turn stock notifications on?

You must be signed in to your Cambridge account to turn product stock notifications on or off.

Sign in Create a Cambridge account arrow icon
×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

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.

×
Please fill in the required fields in your feedback submission.
×