000			01698cam a2200265 i 4500
003			OSt
005			20221024092523.0
008			201125s1994enk a|||| b||| 001 0 eng d
020			_a9780521288811 _qpaperback
040			_cUOC _erda _aUOC _beng
082	0	0	_a511.5 _222 _bALA
100	1		_aGibbons, Alan _q(Alan M.) _eauthor. _c(Alan M.) _9161
245	1	0	_aAlgorithmic graph theory / _cAlan Gibbons.
264		1	_aCambridge : _bThe press Syndicate of the university of Cambridge, _c[1994].
264		4	_c© Cambridge university press 1985.
300			_a259 pages : _billustrations ; _c20 cm.
336			_2rdacontent _atext _btxt
337			_2rdamedia _aunmediated _bn
338			_2rdacarrier _avolume _bnc
500			_aIncludes index.
520			_aThis is a textbook on graph theory, especially suitable for computer scientists but also suitable for mathematicians with interest in computational complexity. Although it introduces most of the classical concepts of pure and applied graph theory (spanning trees, connectivity, genus, colorability, 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. Everyday 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."
650		0	_aGraph theory. _93578
650		0	_aGraph theory _xData processing. _93579
942			_2ddc _cBK
999			_c496 _d496