Publisher description for Combinatorial optimization : networks and matroids / Eugene Lawler.
Bibliographic record and links to related information available from the Library of Congress catalog
Information from electronic data provided by the publisher. May be incomplete or contain other coding.
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.
Library of Congress subject headings for this publication: Combinatorial optimization, Matroids, Network analysis (Planning)Computational complexity, Algorithms