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 ...Celý popis
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.
Proč nakupovat na Enbooku?
Velký výběr
Nabízíme miliony knih v angličtině. Od beletrie až po ty nejodborněji odborné.
Poštovné zdarma
Poštovné už od 54 Kč a při objednávce nad 1499 Kč doprava na pobočku Zásilkovny zdarma.
Skvělé ceny
Ceny knih se snažíme držet při zemi a vždy pod cenou doporučovanou vydavatelem, aby si je mohl koupit opravdu každý.
Online podpora
Můžete využít online chatu, emailu nebo nám zatelefonovat.
Osobní přístup
Nejdůležitější je pro nás Vaše spokojenost. Prodáváme knihy, protože je milujeme. Nejsme žádní nadnárodní giganti, ale poctivá česká firma.