Zur Startseite gehen
0,00 €*
Cover: 9780521288811 | Algorithmic Graph Theory | Alan Gibbons | Taschenbuch | Paperback
Dekorationsartikel gehören nicht zum Leistungsumfang.
Algorithmic Graph Theory
Taschenbuch von Alan Gibbons
Sprache: Englisch

65,25 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 1-2 Wochen

Kategorien:
Beschreibung
This is a textbook on graph theory, especially suitable for computer scientists but also suitable for mathematicians with an interest in computational complexity. Although it introduces most of the classical concepts of pure and applied graph theory (spanning trees, connectivity, genus, colourability, flows in networks, matchings and traversals) and covers many of the major classical theorems, the emphasis is on algorithms and their complexity: which graph problems have known efficient solutions and which are intractable. For the intractable problems a number of efficient approximation algorithms are included with known performance bounds. Informal use is made of a PASCAL-like programming language to describe the algorithms.
A number of exercises and outlines of solutions are included to extend and motivate the material of the text.
This is a textbook on graph theory, especially suitable for computer scientists but also suitable for mathematicians with an interest in computational complexity. Although it introduces most of the classical concepts of pure and applied graph theory (spanning trees, connectivity, genus, colourability, flows in networks, matchings and traversals) and covers many of the major classical theorems, the emphasis is on algorithms and their complexity: which graph problems have known efficient solutions and which are intractable. For the intractable problems a number of efficient approximation algorithms are included with known performance bounds. Informal use is made of a PASCAL-like programming language to describe the algorithms.
A number of exercises and outlines of solutions are included to extend and motivate the material of the text.
Inhaltsverzeichnis
Preface; 1. Introducing graphs and algorithmic complexity; 2. Spanning-trees, branchings and connectivity; 3. Planar graphs; 4. Networks and flows; 5. Matchings; 6. Eulerian and Hamiltonian tours; 7. Colouring graphs; 8. Graph problems and intractability; Appendix; Author Index; Subject Index.
Details
Erscheinungsjahr: 1985
Fachbereich: Arithmetik & Algebra
Genre: Mathematik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Seiten: 272
ISBN-13: 9780521288811
ISBN-10: 0521288819
Sprache: Englisch
Ausstattung / Beilage: Paperback
Einband: Kartoniert / Broschiert
Autor: Gibbons, Alan
Hersteller: Cambridge University Press
Maße: 229 x 152 x 17 mm
Von/Mit: Alan Gibbons
Erscheinungsdatum: 01.07.1985
Gewicht: 0,446 kg
preigu-id: 101152569
Inhaltsverzeichnis
Preface; 1. Introducing graphs and algorithmic complexity; 2. Spanning-trees, branchings and connectivity; 3. Planar graphs; 4. Networks and flows; 5. Matchings; 6. Eulerian and Hamiltonian tours; 7. Colouring graphs; 8. Graph problems and intractability; Appendix; Author Index; Subject Index.
Details
Erscheinungsjahr: 1985
Fachbereich: Arithmetik & Algebra
Genre: Mathematik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Seiten: 272
ISBN-13: 9780521288811
ISBN-10: 0521288819
Sprache: Englisch
Ausstattung / Beilage: Paperback
Einband: Kartoniert / Broschiert
Autor: Gibbons, Alan
Hersteller: Cambridge University Press
Maße: 229 x 152 x 17 mm
Von/Mit: Alan Gibbons
Erscheinungsdatum: 01.07.1985
Gewicht: 0,446 kg
preigu-id: 101152569
Warnhinweis

Ähnliche Produkte

Diese Website verwendet Cookies, um eine bestmögliche Erfahrung bieten zu können. Mehr Informationen ...