BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Network Flow Algorithms

Network Flow Algorithms

Network Flow Algorithms
Stock photo: cover may vary

Network Flow Algorithms Hardback - 2019

by Williamson, David P

Add to wish list
  • Used
  • Good
  • Hardback
Used - Good

Description

hardcover. Good. Access codes and supplements are not guaranteed with used items. May be an ex-library book.
Ask the seller a question Add to wish list
A$249.00
Free Delivery within USA
Standard delivery: 7 to 14 days
More delivery options
Dropship order
Ships from Bonita (California, United States)

Details

  • Title Network Flow Algorithms
  • Author Williamson, David P
  • Binding Hardback
  • Condition Used - Good
  • Pages 326
  • Volumes 1
  • Language ENG
  • Publisher Cambridge University Press
  • Publication date 2019-09-05
  • Features Bibliography, Index
  • Bookseller's Inventory # 1107185890.G
  • ISBN 9781107185890 / 1107185890
  • Weight 1.2 lbs (0.54 kg)
  • Dimensions 9.21 x 6.38 x 0.87 in (23.39 x 16.21 x 2.21 cm)
  • Category Computers - General Information
  • Library of Congress subjects System theory, Computer algorithms
  • Library of Congress Catalogue Number 2019011352
  • Dewey Decimal Code 003
  • Quantity available 1

About Bonita California, United States

Biblio member since 2020

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Bonita

Reader reviews for Network Flow Algorithms

From the publisher

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.
tracking-