Name: Network Flow Algorithms
Price: 2160.00 TWD
Availability: InStock
Author: David P. Williamson
ISBN: 9781316636831

Select your country

Americas

Europe

Rest of the world

Type

Physical Book

Publisher

Cambridge University Press

Author

David P. Williamson

Year

2019

Language

English

Pages

326

Format

Paperback

ISBN13

9781316636831

Edition No.

Synopsis "Network Flow Algorithms "

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.

Customers reviews

Have you read this book? Login to add your review.

More customer reviews

0% (0)
0% (0)
0% (0)
0% (0)
0% (0)

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews

Network Flow Algorithms - David P. Williamson

Synopsis "Network Flow Algorithms "

Customers reviews

Frequently Asked Questions about the Book

Is the book original?

In what language is the book written?

What is the format of this book?

Questions and Answers about the Book

Opinions about Bookdelivery