|
|
|
|
| LEADER |
00000cam a2200000 7i4500 |
| 001 |
0000076402 |
| 005 |
20111101093000.0 |
| 008 |
111006s2002 nju eng |
| 020 |
|
|
|a 0130920002
|
| 020 |
|
|
|a 9780130920003
|
| 050 |
0 |
0 |
|a QA39.3
|b .G66 2002
|
| 090 |
0 |
0 |
|a QA39.3
|b .G66 2002
|
| 100 |
1 |
|
|a Goodaire, Edgar G. ,
|e author
|
| 245 |
1 |
0 |
|a Discrete mathematics with graph theory
|c Edgar G. Goodaire, Michael M. Parmenter
|
| 260 |
|
|
|a Upper Saddle River :
|b Prentice Hall ,
|c c2002
|
| 300 |
|
|
|a xv, 465 p. :
|b ill. ;
|c 25 cm.
|
| 504 |
|
|
|a Includes bibliographical references and index
|
| 505 |
0 |
|
|a 1. Yes, there are proofs! -- 2. Sets and relations -- 3. Functions -- 4. The integers -- 5. Induction and recursion -- 6. Principles of counting -- 7. Permutations and combinations -- 8. Algorithms -- 9. Graphs -- 10. Paths and circuits -- 11. Application of paths and circuits -- 12. Trees -- 13. Depth-first search and applications -- 14. Planar graphs and colorings -- 15. The max flow-min cut theorem
|
| 650 |
|
0 |
|a Computer science
|x Mathematics
|
| 650 |
|
0 |
|a Graph theory
|
| 650 |
|
0 |
|a Mathematics
|
| 999 |
|
|
|a 1000141559
|b Book
|c OPEN SHELF (30 DAYS)
|e Gong Badak Campus
|