Tipsa dina vänner om produkten:
Network Flow Algorithms Williamson, David P. (Cornell University, New York)
Pris
SEK 709
Beställningsvara
Förväntad leverans 26 okt - 3 nov
Få avisering om nya utgåvor med Williamson, David P. (Cornell University, New York)
Lägg till din iMusic-önskelista
eller
Finns även som:
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öcker Pocketbok (Bok med mjukt omslag och limmad rygg) |
| Releasedatum | 5 september 2019 |
| ISBN13 | 9781316636831 |
| Utgivare | Cambridge University Press |
| Antal sidor | 326 |
| Mått | 151 × 227 × 18 mm · 492 g |
| Språk | Engelska |
