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.
Prečo nakupovať na Enbooku?
VEĽKÝ VÝBER
Ponúkame milióny kníh v angličtine. Od beletrie až po tie najodbornejšie odborné.
POŠTOVNÉ ZADARMO
Poštovné už od 2,99 € a pri objednávke nad 60 € doprava na pobočku Zásielkovne zadarmo
SKVELÉ CENY
Ceny kníh sa snažíme držať pri zemi a vždy pod cenou odporúčanou vydavateľom, aby si ich mohol kúpiť naozaj každý.
OVERENÉ ZÁKAZNÍKMI
Získali sme certifikát "Overené zákazníkmi" na Heureka.sk. Prezrite si naše recenzie
ONLINE PODPORA
Môžete využiť online chat, email alebo nám zatelefonovať.