株式会社極東書店トップ ＞ 商品一覧 ＞ Network Flow Algorithms.
商品詳細
Network Flow Algorithms.
・ISBN 978-1-107-18589-0 hard GB£ 91.00
￥28,828.- (税込) ※（※）価格はご注文時の参考価格となります。
納品価格につきましては書籍の入荷時点で確定となります。
版元の原価改定、外国為替の変動等により異なる場合がございますので、予めご了承下さい。
お気に入り
★★★
電子版あり 大学・学術機関向け電子ブック（eBook）ISBN 978-1-316-88856-8
| 著者・編者 | Williamson, David P., |
|---|---|
| 出版社 | (Cambridge University Press, UK) |
| 出版年月 | 2019 |
| ページ数 | 326 pp. |
| 言語 | ENG |
| ニュース番号 | ＜M25-16056＞ |
解説
Network flow theory has been used across a number of disciplines, including theoretical computer science, operations research, and discrete math, to model not only problems in the transportation of goods and information, but also a wide range of applications from image segmentation problems in computer vision to deciding when a baseball team has been eliminated from contention. This graduate text and reference presents a succinct, unified view of a wide variety of efficient combinatorial algorithms for network flow problems, including many results not found in other books. It covers maximum flows, minimum-cost flows, generalized flows, multicommodity flows, and global minimum cuts and also presents recent work on computing electrical flows along with recent applications of these flows to classical problems in network flow theory.