Network flow algorithms
Auteur :
Williamson, David P.
Éditeur :
Cambridge University Press
ISBN :
9781316636831
Date de publication :
5 sept. 2019
Dimensions :
22,7 x 15,2 x 1,9 cm
Poids :
480 g
Format :
Trade paperback (US)
Langue :
Anglais
Pays d'origine :
Grande Bretagne
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.