Combinatorial Optimization: Networks and Matroids

(Code: 9780486414539)
£ 15.99 (18.68 €)
Currently ships 2 - 5 days
Add to cart
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.

Illustrations: -
Author: Lawler
Size: -
Format: Book
Copyright: -
ISBN 13: 9780486414539

FREE Shipping on 3 books or more ! - for all UK orders.