Mohlo by se vám také líbit

Více informací o knize Algorithmic Graph Theory

• Parametry knihy
• Anotace
• Oblíbené z jiného soudku

Nákupem získáte 139 bodů

Anotace knihy

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.

Parametry knihy

Zařazení knihy Knihy v angličtině Mathematics & science Mathematics Combinatorics & graph theory

• Plný název: Algorithmic Graph Theory
• Autor: Alan Gibbons
• Jazyk: Angličtina
• Vazba: Brožovaná
• Počet stran: 272
• EAN: 9780521288811
• ISBN: 0521288819
• ID: 02026690
• Nakladatelství: Cambridge University Press
• Hmotnost: 442 g
• Rozměry: 153 × 230 × 10 mm
• Datum vydání: 27. June 1985

Oblíbené z jiného soudku

---

---

---