Network Flow Algorithms
1127 Kč
Sleva až 70% u třetiny knih
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.
| Autor: | Williamson, David |
| Nakladatel: | Cambridge University Press |
| ISBN: | 9781316636831 |
| Rok vydání: | 2019 |
| Jazyk : | Angličtina |
| Vazba: | Paperback / softback |
| Počet stran: | 326 |
Mohlo by se vám také líbit..
-
Access to History: The Cold War 1941-95
Williamson, David
-
Quantum Computing for Computer Scien...
Yanofsky, Noson S.
-
Learning Scientific Programming with ...
Hill, Christian
-
Mathematics for Machine Learning
Deisenroth, Marc Peter (University College London); Faisal, A. Aldo (Imperial College London); Ong, Cheng Soon
-
Mining of Massive Datasets
Leskovec, Jure (Stanford University, California); Rajaraman, Anand; Ullman, Jeffrey David (Stanford University, Californ
-
Game Theory Basics
Von Stengel, Rudiger
-
Mastering Mathematical Finance
Capinski, Maciej J.; Kopp, Ekkehard
-
A Level Comp 2 Computer Science OCR
Surrall, Alistair; Hamflett, Adam
-
A/AS Level Computer Science for WJEC...
Surrall, Alistair; Hamflett, Adam
-
A Hands-On Introduction to Data Science
Shah, Chirag (University of Washington)
-
Foundations of Cryptography: Volume ...
Goldreich, Oded
-
Integer Linear Programming in Comput...
Gusfield, Dan (University of California, Davis)
-
Purely Functional Data Structures
Okasaki, Chris (Columbia University, New York)
-
Modern Statistics for Modern Biology
Holmes, Susan (Stanford University, California); Huber, Wolfgang
-
Modern Compiler Implementation in ML
Appel, Andrew W.
-
Foundations of Data Science
Blum, Avrim; Hopcroft, John (Cornell University, New York); Kannan, Ravi