Free Shipping on Orders of $75 or more.
Sell Books in Your Shopify Store
Adding book to your cart
Report copyright infringement
by Eugene Lawler (Author)
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.
No books in the cart.
A small yet very thoughtful devotional book. A beautiful way to promote seeing God everyday in everything.
genuinely a good read
It’s a great item, exactly what i was expecting 😊
Está perfecto con muchas páginas para dibujar
Llego bien gracias.
