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.

등록된 사용후기

사용후기 쓰기 새 창 더보기

사용후기가 없습니다.

등록된 상품문의

상품문의 쓰기새 창 더보기

상품문의가 없습니다.

배송정보

교환/반품 정보