Network flow algorithms / (Record no. 66994)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 01500cam a22002298i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 20880055 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20210803122022.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 190307s2019 enk b 001 0 eng |
| 010 ## - LIBRARY OF CONGRESS CONTROL NUMBER | |
| LC control number | 2019011352 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9781316636831 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9781107185890 (hardback : alk. paper) |
| 082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 003 WIL-D |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Williamson, David P. |
| 245 10 - TITLE STATEMENT | |
| Title | Network flow algorithms / |
| Statement of responsibility, etc. | David P. Williamson |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication, distribution, etc. | United Kingdom |
| Name of publisher, distributor, etc. | Cambridge University Press |
| Date of publication, distribution, etc. | 2019 |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | 314 p. |
| 365 ## - TRADE PRICE | |
| Price type code | GBP |
| Price amount | 29.99 |
| 500 ## - GENERAL NOTE | |
| General note | 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 present 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. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Network analysis (Planning) |
| General subdivision | Computer programs. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | System theory. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Computer algorithms. |
| 952 ## - LOCATION AND ITEM INFORMATION (KOHA) | |
| Withdrawn status | |
| Lost status | Source of classification or shelving scheme | Damaged status | Not for loan | Collection code | Home library | Current library | Shelving location | Date acquired | Total Checkouts | Full call number | Barcode | Date last seen | Date last checked out | Price effective from | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Dewey Decimal Classification | 003-007 | BITS Pilani Hyderabad | BITS Pilani Hyderabad | General Stack (For lending) | 02/08/2021 | 1 | 003 WIL-D | 42556 | 26/07/2023 | 23/10/2021 | 02/08/2021 | Books |
