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 Paperback - 2019

by David P. Williamson

Add to wish list
  • New
  • Paperback
New

Description

Cambridge University Press. PAPERBACK. New. COMPUTER SCIENCE Algorithmics, Complexity, Computer
Ask the seller a question Add to wish list
A$148.36
A$21.86 Delivery to USA
Standard delivery: 20 to 30 days
More delivery options
Ships from Sanctum Books (Delhi, India)

Details

  • Title Network Flow Algorithms
  • Author David P. Williamson
  • Binding Paperback
  • Condition New
  • Pages 326
  • Volumes 1
  • Language ENG
  • Publisher Cambridge University Press
  • Publication date 2019-09-05
  • Features Bibliography, Index
  • Bookseller's Inventory # Cambridge-9781316636831
  • ISBN 9781316636831 / 1316636836
  • Weight 1 lbs (0.45 kg)
  • Dimensions 9.14 x 6.41 x 0.72 in (23.22 x 16.28 x 1.83 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 500

About Sanctum Books Delhi, India

Biblio member since 2010

We are leading publishers, booksellers, distributors, importers, and exporters. We carry a large selection of books on varied subjects. Do place your valued order or let us know your requirement via email.

Terms of Sale:

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

Books are shipped by Registered Air Mail or DHL/FedEx/Aramex. Additional shipping charges may be required for multi-volume sets.

Browse books from Sanctum Books

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-