Graphs, networks, and algorithms / Dieter Jungnickel.
Tipo de material:
TextoIdioma: Inglés Lenguaje original: Alemán Series Algorithms and computation in mathematics ; 5Editor: Heidelberg ; New York : Springer, [2013]Fecha de copyright: ©2013Edición: Fourth editionDescripción: xx, 675 páginas : ilustracionesISBN: - 9783642322778
- Graphen, Netzwerke und Algorithmen. English
- 23 511.6
Contenidos:
1. Basic graph theory -- 2. Algorithms and complexity -- 3. Shortest paths -- 4. Spanning trees -- 5. The greedy algorithm -- 6. Flows -- 7. Combinatorial applications -- 8. Connectivity and depth first search -- 9. Colorings -- 10. Circulations -- 11. The network simplex algorithm -- 12. Synthesis of networks -- 13. Matchings -- 14. Weighted matchings -- 15. A hard problem: the TSP -- Appendix A. Some NP-complete problems -- Appendix B. Solutions -- Appendix C. List of symbols.
| Tipo de ítem | Biblioteca actual | Colección | Signatura topográfica | Estado | Fecha de vencimiento | Código de barras | Reserva de ítems | |
|---|---|---|---|---|---|---|---|---|
Libros
|
Ingeniería General | General | 511.6 J95g [2013] | Disponible | 00428955 |
Total de reservas: 0
Earlier editions published in 1998, 2004, and 2008.
Incluye índice.
Bibliografía: páginas 629-659.
1. Basic graph theory -- 2. Algorithms and complexity -- 3. Shortest paths -- 4. Spanning trees -- 5. The greedy algorithm -- 6. Flows -- 7. Combinatorial applications -- 8. Connectivity and depth first search -- 9. Colorings -- 10. Circulations -- 11. The network simplex algorithm -- 12. Synthesis of networks -- 13. Matchings -- 14. Weighted matchings -- 15. A hard problem: the TSP -- Appendix A. Some NP-complete problems -- Appendix B. Solutions -- Appendix C. List of symbols.