Network Flow Algorithms

人工智能

原   价:
411.25
售   价:
329.00
优惠
平台大促 低至8折优惠
发货周期:预计5-7周发货
作      者
出  版 社
出版时间
2019年05月09日
装      帧
ISBN
9781316636831
复制
页      码
326
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 29 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
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.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个