嶺東科技大學 |

[NT 42591] Language: 簡体中文

[NT 5635] Back

[NT 59884] Switch To: [NT 5556] Labeled | [NT 5559] MARC Mode | [NT 33762] ISBD

Graph algorithms

[NT 42944] Record Type:	[NT 1579] Language materials, printed : [NT 40817] monographic
[NT 47261] Author:	EvenShimon,
[NT 47351] Place of Publication:	Cambridge, NY
[NT 47263] Published:	Cambridge University Press;
[NT 47352] Year of Publication:	2011
[NT 50960] Edition:	2nd ed.
[NT 47264] Description:	xii, 189 p.ill. : 24 cm.;
[NT 47266] Subject:	Graph algorithms. -
[NT 51458] Online resource:	http://assets.cambridge.org/97805215/17188/cover/9780521517188.jpg
[NT 51398] Summary:	"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
[NT 50961] ISBN:	978-0-521-51718-8bound
[NT 50961] ISBN:	0-521-51718-4bound
[NT 50961] ISBN:	p
[NT 60779] Content Note:	Machine 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

Graph algorithms
Even, Shimon

Graph algorithms / Shimon Even - 2nd ed.. - Cambridge, NY : Cambridge University Press, 2011. - xii, 189 p. ; ill. ; 24 cm..
Machine 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.
Includes bibliographical references and index..
ISBN 978-0-521-51718-8ISBN 0-521-51718-4
Graph algorithms.

Graph algorithms
LDR:01648nam2 2200241 450 001 259994
005 20111116111234.0
010 1 $a 978-0-521-51718-8 $b bound $d NT$2369
010 1 $a 0-521-51718-4 $b bound $d NT$2369
010 1 $b p
100 $a 20120105d2011 m y0engy01 b
101 0 $a eng
102 $a us
105 $a a a 001zy
200 1 $a Graph algorithms $f Shimon Even
205 $a 2nd ed.
210 $a Cambridge, NY $d 2011 $c Cambridge University Press
215 1 $a xii, 189 p. $c ill. $d 24 cm.
320 $a Includes bibliographical references and index.
327 0 $a Machine 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
330 $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
606 # $a Graph algorithms. $3 220981
676 $a 511.5
700 1 $a Even $b Shimon $3 271792
801 0 $a cw $b 嶺東科技大學圖書館 $g CCR
856 7 # $3 Cover image $u http://assets.cambridge.org/97805215/17188/cover/9780521517188.jpg $2 http