R of efficient approximation algorithms "Are Included With Known Performance Bounds Use Is Made "included with known performance bounds Informal use made a PASCAL ike programming anguage to describe the algorithms A number
exercises and outlines of are included to extend and motivate the material of the tex.
Of Exercises And Outlines Of
Alan Gibbons ´ 4 charactersGenus colourability flows in networks matchings and traversals and many of the major classical theorems "THE EMPHASIS IS ON ALGORITHMS AND "emphasis is on algorithms and which graph problems have known efficient solutions and which are intractable For the intractable problems a numbe. .
This is a textbook on graph theory especially suitable for computer but also suitable mathematicians with an interest in computational complexity Although it introduces most the classical concepts of and applied graph theory spanning trees connectivity.