Specifications
| book-author | David P. Williamson |
|---|---|
| publisher | September 30; 2019 |
| file-type | |
| pages | 326 pages |
| language | English |
| isbn10 | 1316636836; 1107185890; 1316952894 |
| isbn13 | 9781316636831/ 9781107185890/ 9781316952894 |
Book Description
Network movement idea has been employed throughout quite a few disciplines; together with operations analysis; theoretical laptop science; and discrete math; to mannequin not solely issues within the transportation of data and items but additionally a broad vary of functions from picture segmentation issues in laptop imaginative and prescient to figuring out when a baseball crew has been faraway from competition. Network Flow Algorithms (PDF) offers a succinct; unified view of an intensive number of environment friendly combinatorial algorithms for community movement issues; comprising of many outcomes not present in different ebooks. It consists of most flows; minimal price flows; multicommodity flows; generalized flows; and world minimal cuts and in addition presents the newest work on computing electrical flows together with latest functions of those flows to classical issues in community movement idea.
NOTE: The product solely consists of the ebook Network Flow Algorithms in PDF. No access codes are included.
Reviews
There are no reviews yet