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
-
Cambridge International Examinations
Neelands, Jonothan (University of Warwick, UK)
-
Cambridge International IGCSE
Asker, Nick; Morrison, Karen
-
Panorama francophone 2 Workbook
Bourdais Daniele a kolektiv
-
Theory of Knowledge for the IB Diplo...
Duckling, Tomas
-
Chemistry for the IB Diploma Coursebook
Owens, Steve
-
Cambridge Primary Science Workbook 6 ...
Baxter, Fiona; Dilley, Liz; Cross, Alan
-
Cambridge Primary Mathematics Workboo...
Potter, Gill; Moseley, Cherri
-
Cambridge Primary Mathematics Stage ...
Power, Jo; Morgan, Nicola; Moseley, Cherri; Wallace, Louise; Clissold, Caroline
-
Cambridge Primary Mathematics Learner...
Potter, Gill; Moseley, Cherri
-
Cambridge Lower Secondary Science Wor...
Jones, Mary
-
Cambridge Lower Secondary Mathematics...
Byrd, Greg; Byrd, Lynn; Pearce, Chris
-
Cambridge IGCSE (TM) Chemistry Course...
Harwood, Richard; Chadwick, Timothy
-
Organizational Design
Burton, Richard
-
Cambridge International AS & A L...
Ryan, Lawrie
-
Cambridge International AS & A L...
Norris, Roger