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 cl ...Cały 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 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.
SZEROKI WYBÓR
Oferujemy ponad milion pozycji anglojęzycznych – od literatury pięknej po specjalistyczną .
DARMOWA WYSYŁKA
Darmowa wysyłka do Paczkomatu od 299 zł.
ATRAKCYJNE CENY
Staramy się by ceny książek były na jak najniższym poziomie, zawsze poniżej ceny zalecanej przez wydawcę. Wszystko po to, by każdy mógł sobie pozwolić na zakup.
14 DNI NA ZWROT
Zakupione u nas książki możesz zwrócić do 14 dni, bez podawania powodów. Wystarczy nas o tym poinformować drogą e-mailową i odesłać książki pod nasz adres, a my zwrócimy pieniądze.