|
|
|
|
| LEADER |
00759nam a2200181Ia 4500 |
| 008 |
150624b xxu||||| |||| 00| 0 eng d |
| 082 |
|
|
|a 518.1
|
| 100 |
|
|
|a Hu, T. C.
|
| 245 |
|
|
|a Combinatorial algorithms /
|c T. C. Hu
|
| 250 |
|
|
|a 2nd. ed.
|
| 260 |
|
|
|a New York :
|b Dover Publication,
|c 2002.
|
| 300 |
|
|
|a 354 p.
|
| 505 |
|
|
|a CONTENTS: 1.Shortest paths 2.Maximum flows 3.Dynamic programming 4.Back tracking 5.Binary tree 6.Heuristic and near optimum 7.Matrix multiplication 8.NP-complete 9.Local indexing algorithms 10.Gomary-Hu tree
|
| 653 |
|
|
|a Combinatorial Algorithms
|
| 700 |
|
|
|a Shing, M.T.
|
| 942 |
|
|
|c BK
|
| 999 |
|
|
|c 58969
|d 58969
|
| 952 |
|
|
|0 0
|1 0
|4 0
|6 518_100000000000000_HU_C
|7 0
|9 58946
|a UL
|b UL
|c ST1
|d 2012-10-27
|l 0
|o 518.1 HU/C
|p 84791
|r 2012-10-27
|w 2012-10-27
|y BK
|