Graphs, algorithms, and optimization / William Kocay, Donald L. Kreher.
Tipo de material:
TextoSeries Discrete mathematics and its applicationsDetalles de publicación: Boca Raton : Chapman & Hall/CRC, ©2005.Edición: 1a ediciónDescripción: 483 páginas : ilustraciones ; 24 x 16 centímetrosTipo de contenido: - texto
- sin medio
- volumen
- 1584883960 (alk. paper)
- QA 166 .245 K76 2005
| Tipo de ítem | Biblioteca actual | Biblioteca de origen | Colección | Signatura topográfica | Copia número | Estado | Fecha de vencimiento | Código de barras | Reserva de ítems | |
|---|---|---|---|---|---|---|---|---|---|---|
Libros para consulta en sala
|
Biblioteca Antonio Enriquez Savignac | Biblioteca Antonio Enriquez Savignac | COLECCIÓN RESERVA | QA 166 .245 K76 2005 (Navegar estantería(Abre debajo)) | 1 | No para préstamo | 036965 |
Navegando Biblioteca Antonio Enriquez Savignac estanterías, Colección: COLECCIÓN RESERVA Cerrar el navegador de estanterías (Oculta el navegador de estanterías)
| QA166 D6711 Domination in graphs : advanced topics / | QA166 T8661in Introduction to graph theory / | QA166.16 P4387 Perfect graphs / | QA 166 .245 K76 2005 Graphs, algorithms, and optimization / | QA 174 .7 .S96 S84 2013 Symmetry : a very short introduction / | QA 184 L3718 2010 Fundamentos de álgebra lineal / | QA184 L3918 2007 Álgebra lineal y sus aplicaciones / |
Incluye bibliografía: páginas 469-476 e índice
Graphs and their complements -- Paths and walks -- Some special classes of graphs -- Trees and cycles -- The structure of trees -- Connectivity -- Alternating paths and matchings -- Network flows -- Hamilton cycles - Digraphs -- Graph colorings -- Planar graphs -- Graphs and surfaces -- Linear programming -- The primal-dual algorithm -- Discrete linear programming
" Graph theory offers a rich source of problems and techniques for programming and data structure development, as well as for understanding computing theory, including NP-Completeness and polynomial reduction. A comprehensive text, Graphs, Algorithms, and Optimization features clear exposition on modern algorithmic graph theory presented in a rigorous yet approachable way. The book covers major areas of graph theory including discrete optimization and its connection to graph algorithms. The authors explore surface topology from an intuitive point of view and include detailed discussions on linear programming that emphasize graph theory problems useful in mathematics and computer science. Many algorithms are provided along with the data structure needed to program the algorithms efficiently. The book also provides coverage on algorithm complexity and efficiency, NP-completeness, linear optimization, and linear programming and its relationship to graph algorithms." -- P. [4]
PIT
NUEVOSTELEMAT
