Zobacz książki o podobnej tematyce

Więcej informacji o Algorithmic Graph Theory

• Dane szczegółowe
• Opis
• Ulubione w innej kategorii

Za ten zakup dostaniesz 168 punkty

Opis

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 thier 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.

Szczegóły książki

Kategoria Książki po angielsku Mathematics & science Mathematics Combinatorics & graph theory

• Pełny tytuł: Algorithmic Graph Theory
• Autor: Alan Gibbons
• Język: Angielski
• Oprawa: Miękka
• Liczba stron: 272
• EAN: 9780521288811
• ISBN: 0521288819
• ID: 02026690
• Wydawca: Cambridge University Press
• Waga: 442 g
• Wymiary: 153 × 230 × 10 mm
• Data wydania: 27. June 1985

Ulubione w innej kategorii

---

---

---