topics algorithmic graph theory (12 résultats)

Etat : New. In English.

Etat : New. 1st edition NO-PA16APR2015-KAP.

Hardcover. Etat : Brand New. 380 pages. 9.25x6.25x0.85 inches. In Stock.

Buch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering.

Hardcover. Etat : 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. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Hardcover. Etat : Brand New. 380 pages. 9.25x6.25x0.85 inches. In Stock. This item is printed on demand.

Hardcover. Etat : 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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Etat : 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.

Etat : New. Print on Demand.

Etat : New. PRINT ON DEMAND.

Buch. Etat : Neu. Topics in Algorithmic Graph Theory | Lowell W. Beineke (u. a.) | Buch | Gebunden | Englisch | 2021 | Cambridge University Press | EAN 9781108492607 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.

Hardcover. Etat : 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. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.