Algorithmic Graph Theory - Alan Gibbons

Name: Algorithmic Graph Theory - Alan Gibbons
Brand: CAMBRIDGE UNIVERSITY PRESS
Availability: InStock

+ Dodaj do porównania Dodaj do listy zakupowej

Rozmiar

uniwersalny

330,74 zł

/ szt.

Najniższa cena z 30 dni przed obniżką: ~~314,30 zł~~ / szt.+5%

Cena regularna: ~~333,21 zł~~ / szt.-1%

Możesz kupić także poprzez:

Produkt dostępny

Darmowa i szybka dostawa od 199,00 zł

14 dni na łatwy zwrot

Bezpieczne zakupy

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.

EAN: 9780521288811

Producent

CAMBRIDGE UNIVERSITY PRESS

Kod produktu

481FAM03527KS

Rok wydania

1985

Elementy

272

Oprawa

Miekka

Format