Overview
Dieses Buch befasst sich mit schweren Problemen auf Graphen, für die es vermutlich keine effizienten Algorithmen gibt, und stellt verschiedene Methoden vor, wie man mit der algorithmischen Härte solcher Probleme umgehen kann. Einerseits kann man effiziente Algorithmen entwerfen, die sich eine geeignete Baumstruktur der Graphen zunutze machen; andererseits erlauben Fest-Parameter-Algorithmen eine effiziente Lösung, wenn gewisse Graphenparameter klein sind. Auch wenn diese Methoden nicht anwendbar sind, können die vorhandenen exakten Exponentialzeit-Algorithmen für solche schweren Probleme oft verbessert werden. Durch die leicht verständliche Darstellung, viele erklärende Abbildungen, Beispiele und Übungsaufgaben sowie die durchdachte Auswahl von Resultaten und Techniken ist dieses Buch besonders gut für den Einsatz in der Lehre geeignet, vor allem im Masterstudium Informatik und in den höheren Semestern des Bachelorstudiums Informatik. Gleichzeitig führt es den Leser unmittelbar an die Fronten der aktuellen Forschung in diesem neuen Teilgebiet der Algorithmik heran.
Full Product Details
Author: Frank Gurski ,
Irene Rothe ,
Jörg Rothe ,
Egon Wanke
Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition: 2010 ed.
Weight: 0.735kg
ISBN: 9783642044991
ISBN 10: 3642044999
Pages: 332
Publication Date: 26 September 2010
Audience:
Professional and scholarly
,
Professional & Vocational
Format: Paperback
Publisher's Status: Active
Availability: Manufactured on demand
We will order this item for you from a manufactured on demand supplier.
Language: German
Reviews
From the reviews: This textbook deals with exact algorithms for NP-complete graph problems. This textbook aims at students of Computer Science . Because of its self-contained construction, illustrations, exercises and references to original sources the book can guide private studies. More likely, a course on recent developments in graph algorithms will be based on it. (Haiko Muller, Zentralblatt MATH, Vol. 1207, 2011)
From the reviews: This textbook deals with exact algorithms for NP-complete graph problems. This textbook aims at students of Computer Science . Because of its self-contained construction, illustrations, exercises and references to original sources the book can guide private studies. More likely, a course on recent developments in graph algorithms will be based on it. (Haiko Muller, Zentralblatt MATH, Vol. 1207, 2011) From the reviews: This textbook deals with exact algorithms for NP-complete graph problems. This textbook aims at students of Computer Science . Because of its self-contained construction, illustrations, exercises and references to original sources the book can guide private studies. More likely, a course on recent developments in graph algorithms will be based on it. (Haiko Muller, Zentralblatt MATH, Vol. 1207, 2011) From the reviews: This textbook deals with exact algorithms for NP-complete graph problems. This textbook aims at students of Computer Science . Because of its self-contained construction, illustrations, exercises and references to original sources the book can guide private studies. More likely, a course on recent developments in graph algorithms will be based on it. (Haiko Muller, Zentralblatt MATH, Vol. 1207, 2011)
From the reviews: This textbook deals with exact algorithms for NP-complete graph problems. This textbook aims at students of Computer Science . Because of its self-contained construction, illustrations, exercises and references to original sources the book can guide private studies. More likely, a course on recent developments in graph algorithms will be based on it. (Haiko Muller, Zentralblatt MATH, Vol. 1207, 2011) From the reviews: This textbook deals with exact algorithms for NP-complete graph problems. ... This textbook aims at students of Computer Science ... . Because of its self-contained construction, illustrations, exercises and references to original sources the book can guide private studies. More likely, a course on recent developments in graph algorithms will be based on it. (Haiko Muller, Zentralblatt MATH, Vol. 1207, 2011) From the reviews: This textbook deals with exact algorithms for NP-complete graph problems. This textbook aims at students of Computer Science . Because of its self-contained construction, illustrations, exercises and references to original sources the book can guide private studies. More likely, a course on recent developments in graph algorithms will be based on it. (Haiko Muller, Zentralblatt MATH, Vol. 1207, 2011) From the reviews: This textbook deals with exact algorithms for NP-complete graph problems. This textbook aims at students of Computer Science . Because of its self-contained construction, illustrations, exercises and references to original sources the book can guide private studies. More likely, a course on recent developments in graph algorithms will be based on it. (Haiko Muller, Zentralblatt MATH, Vol. 1207, 2011)
From the reviews: This textbook deals with exact algorithms for NP-complete graph problems. ... This textbook aims at students of Computer Science ... . Because of its self-contained construction, illustrations, exercises and references to original sources the book can guide private studies. More likely, a course on recent developments in graph algorithms will be based on it. (Haiko M�ller, Zentralblatt MATH, Vol. 1207, 2011)
Author Information
Prof. Dr. Jörg Rothe, lehrt an der Heinrich-Heine-Universität Düsseldorf, Institut für Informatik, Germany
