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 / softback - 2019

by David P. Williamson

Add to wish list
  • New
  • Paperback
New

Description

Paperback / softback. New. This comprehensive text and reference for graduate students and professionals in theoretical computer science, operations research, and discrete math offers an up-to-date, unified view of efficient combinatorial algorithms for a wide variety of network flow problems, including recent work on computing electrical flows and their applications.
Ask the seller a question Add to wish list
A$86.90
A$19.46 Delivery to USA
Standard delivery: 14 to 21 days
More delivery options
Ships from The Saint Bookstore (Merseyside, United Kingdom)

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 # B9781316636831
  • 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 10

About The Saint Bookstore Merseyside, United Kingdom

Biblio member since 2018

The Saint Bookstore specialises in hard to find titles & also offers delivery worldwide for reasonable rates.

Terms of Sale: Refunds or Returns: A full refund of the price paid will be given if returned within 30 days in undamaged condition. If the product is faulty, we may send a replacement.

Browse books from The Saint Bookstore

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-