Combinatorial algorithms /
Guardado en:
| Autor Principal: | |
|---|---|
| Formato: | Libro |
| Idioma: | English |
| Publicado: |
Reading, Mass. :
Addison-Wesley,
c1982.
|
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| LEADER | 00795nam a22001935a 4500 | ||
|---|---|---|---|
| 001 | MAT.inmabb003475 | ||
| 008 | 051213s1982####maua#####b####001#0#eng#d | ||
| 005 | 20130318180453.0 | ||
| 245 | 1 | 0 | |a Combinatorial algorithms / |c T. C. Hu. |
| 260 | |a Reading, Mass. : |b Addison-Wesley, |c c1982. | ||
| 300 | |a 292 p. : |b il. ; |c 25 cm. | ||
| 504 | |a Incluye referencias bibliográficas. | ||
| 505 | 0 | |a 1. Shortest paths -- 2. Maximum flow -- 3. Dynamic programming -- 4. Backtracking -- 5. Binary trees -- 6. Heuristic algorithms -- 7. Matrix multiplication -- 8. NP-complete problems. | |
| 510 | 4 | |a MR, |c 87i:90091 | |
| 020 | |a 0201038595 | ||
| 100 | 1 | |a Hu, T. C. |q (Te Chiang), |d 1930- | |
| 084 | |a 90-01 (05-04 15-04 68R05 68R10 90B10 90C27) |2 msc2000 | ||
| 010 | |a 81015024 | ||
| 859 | |h 90 |i H874 |p A-6156 |b BIB. MATEMATICA | ||