Publicado por Cambridge University Press, 2021
ISBN 10: 1108492606 ISBN 13: 9781108492607
Idioma: Inglés
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 121,68
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In English.
Publicado por Cambridge University Press, Cambridge, 2021
ISBN 10: 1108492606 ISBN 13: 9781108492607
Idioma: Inglés
Librería: CitiRetail, Stevenage, Reino Unido
EUR 133,42
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: new. Hardcover. 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. Written by acknowledged international experts in the field, this book presents fifteen expository chapters in the rapidly expanding area of algorithmic graph theory. It serves graduate students and researchers in graph theory, combinatorics and computer science, as well as mathematicians and computer scientists in related fields. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
Publicado por Cambridge University Press CUP, 2021
ISBN 10: 1108492606 ISBN 13: 9781108492607
Idioma: Inglés
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 169,97
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: New. 1st edition NO-PA16APR2015-KAP.
Publicado por Cambridge University Press, 2021
ISBN 10: 1108492606 ISBN 13: 9781108492607
Idioma: Inglés
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 167,89
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering.
Publicado por Cambridge University Press, 2021
ISBN 10: 1108492606 ISBN 13: 9781108492607
Idioma: Inglés
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 126,01
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Publicado por Cambridge University Press, Cambridge, 2021
ISBN 10: 1108492606 ISBN 13: 9781108492607
Idioma: Inglés
Librería: AussieBookSeller, Truganina, VIC, Australia
EUR 160,82
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: new. Hardcover. 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. Written by acknowledged international experts in the field, this book presents fifteen expository chapters in the rapidly expanding area of algorithmic graph theory. It serves graduate students and researchers in graph theory, combinatorics and computer science, as well as mathematicians and computer scientists in related fields. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
EUR 187,47
Convertir monedaCantidad disponible: 2 disponibles
Añadir al carritoHardcover. Condición: Brand New. 380 pages. 9.25x6.25x0.85 inches. In Stock.
Publicado por Cambridge University Press, Cambridge, 2021
ISBN 10: 1108492606 ISBN 13: 9781108492607
Idioma: Inglés
Librería: Grand Eagle Retail, Mason, OH, Estados Unidos de America
EUR 151,15
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: new. Hardcover. 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. Written by acknowledged international experts in the field, this book presents fifteen expository chapters in the rapidly expanding area of algorithmic graph theory. It serves graduate students and researchers in graph theory, combinatorics and computer science, as well as mathematicians and computer scientists in related fields. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 128,90
Convertir monedaCantidad disponible: 1 disponibles
Añadir al carritoHardcover. Condición: Brand New. 380 pages. 9.25x6.25x0.85 inches. In Stock. This item is printed on demand.
Publicado por Cambridge University Press, 2021
ISBN 10: 1108492606 ISBN 13: 9781108492607
Idioma: Inglés
Librería: moluna, Greven, Alemania
EUR 135,49
Convertir monedaCantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. InhaltsverzeichnisForeword 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 Colour.
Publicado por Cambridge University Press, 2021
ISBN 10: 1108492606 ISBN 13: 9781108492607
Idioma: Inglés
Librería: Majestic Books, Hounslow, Reino Unido
EUR 177,62
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand.
Publicado por Cambridge University Press, 2021
ISBN 10: 1108492606 ISBN 13: 9781108492607
Idioma: Inglés
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 181,33
Convertir monedaCantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND.