000			01837nam a22003377a 4500
001			sulb-eb0017164
003			BD-SySUS
005			20160405140636.0
008			110214s2011||||enk o ||1 0|eng|d
020			_a9781139015165 (ebook)
020			_z9780521517188 (hardback)
020			_z9780521736534 (paperback)
040			_aUkCbUP _beng _erda _cUkCbUP _dBD-SySUS.
050	0	0	_aQA166 _b.E93 2012
082	0	0	_a511/.5 _223
100	1		_aEven, Shimon, _eauthor.
245	1	0	_aGraph Algorithms / _cShimon Even ; edited by Guy Even.
250			_a2nd ed.
264		1	_aCambridge : _bCambridge University Press, _c2011.
300			_a1 online resource (202 pages) : _bdigital, PDF file(s).
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
500			_aTitle from publisher's bibliographic system (viewed on 04 Apr 2016).
520			_aShimon Even's Graph Algorithms, published in 1979, was a seminal introductory book on algorithms read by everyone engaged in the field. This thoroughly revised second edition, with a foreword by Richard M. Karp and notes by Andrew V. Goldberg, continues the exceptional presentation from the first edition and explains algorithms in a formal but simple language with a direct and intuitive presentation. The book begins by covering basic material, including graphs and shortest paths, trees, depth-first-search and breadth-first search. The main part of the book is devoted to network flows and applications of network flows, and it ends with chapters on planar graphs and testing graph planarity.
650		0	_aGraph algorithms
700	1		_aEven, Guy, _eeditor.
776	0	8	_iPrint version: _z9780521517188
856	4	0	_uhttp://dx.doi.org/10.1017/CBO9781139015165
942			_2Dewey Decimal Classification _ceBooks
999			_c38602 _d38602