Description: Topics in Algorithmic Graph Theory: 178 (Encyclopedia of Mathematics and its Applications, Series Number 178) Cambridge University Press Hardcover Unused and unread, minor cosmetic imperfections such as scuffing or minor creasing. Stamped 'damaged' by publisher to a non-text page. EAN: 9781108492607 Published: 03/06/2021 Language: English 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. 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. DispatchIn stock here - same-day dispatch from England. My SKU: 3282538RefundsNo-hassle refunds are always available if your book is not as expected.Terms and Conditions of SaleSorry - no collections. All sales are subject to extended Terms and Conditions of Sale as well as the Return Policy and Payment Instructions. Visit my eBay Store for details andmany more books. Template layout and design, "JNC Academic Books", "needbooks", Copyright © JNC INC. Designated trademarks, layouts and brands are the property of their respective owners. All Rights Reserved.
Price: 39.99 GBP
Location: Welwyn Garden City
End Time: 2024-12-28T22:15:46.000Z
Shipping Cost: 125.83 GBP
Product Images
Item Specifics
Return postage will be paid by: Buyer
Returns Accepted: Returns Accepted
After receiving the item, your buyer should cancel the purchase within: 30 days
Return policy details:
Number of Pages: 364 Pages
Language: English
Publication Name: Topics in Algorithmic Graph Theory
Publisher: Cambridge University Press
Publication Year: 2021
Subject: Computer Science, Mathematics
Item Height: 241 mm
Item Weight: 680 g
Type: Textbook
Author: Martin Charles Golumbic, Robin J. Wilson, Lowell W. Beineke
Series: Encyclopedia of Mathematics and Its Applications
Item Width: 162 mm
Format: Hardcover