Books > Computing & IT > General theory of computing > Data structures
|
Buy Now
Network Flow Algorithms (Paperback)
Loot Price: R1,215
Discovery Miles 12 150
|
|
Network Flow Algorithms (Paperback)
Expected to ship within 10 - 15 working days
|
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.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
|
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.