文件名称：Network Flows Theory, Algorithms, and Applications
文件大小：8.18MB
文件格式：PDF
更新时间：2014-06-18 04:52:21
graphcut max flow
Bringing together the classic and the contemporary aspects of the field, this comprehensive introduction to network flows provides an integrative view of theory, algorithms, and applications. It offers in-depth and self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including a description of new and novel polynomial-time algorithms for these core models. For professionals working with network flows, optimization, and network programming.