Networks and MatroidseBook - 2001
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.
Publisher: Mineola, N.Y. : Dover Publications, 
Copyright Date: ©2001
Branch Call Number: 519.3 La
Description: 1 online resource (x, 374 pages) : illustrations