000			02767cam a2200361 a 4500
999			_c7251 _d7251
001			751830708
005			20190512132423.0
008			110912s2012 nyua b 001 0 eng
010			_a2011037984
020			_a9780521517188 (hardback)
020			_a0521517184 (hardback)
020			_a9780521736534 (paperback)
020			_a0521736536 (paperback)
040			_aDLC _cDLC _dYDX _dBTCTA _dUKMGB _dYDXCP _erda
050	0	0	_aQA166 _b.E93 2012
082	0	0	_a511.5 _223 _bE.S.G
100	1		_aEven, Shimon.
245	1	0	_aGraph algorithms / _cShimon Even ; edited by Guy Even.
250			_a2nd ed.
260			_aCambridge ; _aNew York : _bCambridge University Press, _c2012.
300			_axii, 189 p. : _bill. ; _c24 cm.
336			_2rdacontent _atext
337			_2rdamedia _aunmediated
338			_2rdacarrier _avolume
504			_aIncludes bibliographical references and index.
505	8		_aMachine generated contents note: 1. Paths in graphs; 2. Trees; 3. Depth-first search; 4. Ordered trees; 5. Flow in networks; 6. Applications of network flow techniques; 7. Planar graphs; 8. Testing graph planarity.
520			_a"Shimon 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"--Provided by publisher.
520			_a"Shimon 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"--Provided by publisher.
650		0	_aGraph algorithms.
856			_3Abstract _uhttp://repository.fue.edu.eg/xmlui/handle/123456789/2742
942			_cBK _2ddc