Fortell venner om denne varen:
Network Flow Algorithms Williamson, David P. (Cornell University, New York)
Har du en profil? Logg inn
Få varsel om nye utgivelser fra Williamson, David P. (Cornell University, New York)
Legg til iMusic ønskeliste
eller
Network Flow Algorithms
Williamson, David P. (Cornell University, New York)
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.
326 pages, Worked examples or Exercises; 1 Halftones, black and white; 51 Line drawings, black and w
| Media | Bøker Pocketbok (Bok med mykt omslag og limt rygg) |
| Utgitt | 5. september 2019 |
| ISBN13 | 9781316636831 |
| Utgivere | Cambridge University Press |
| Antall sider | 326 |
| Mål | 151 × 227 × 18 mm · 492 g |
| Språk | Engelsk |
