Compartir
combinatorial optimization: networks and matroids
Eugene Lawler
(Autor)
·
Dover Publications
· Tapa Blanda
combinatorial optimization: networks and matroids - Lawler, Eugene
Sin Stock
Te enviaremos un correo cuando el libro vuelva a estar disponible
Reseña del libro "combinatorial optimization: networks and matroids"
Perceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. A suitable text or reference for courses in combinatorial computing and concrete computational complexity in departments of computer science and mathematics.
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
Todos los libros de nuestro catálogo son Originales.
El libro está escrito en Inglés.
La encuadernación de esta edición es Tapa Blanda.
✓ Producto agregado correctamente al carro, Ir a Pagar.