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.
Toode on otsas
Detailid
Lehekülgede arv326 lehekülge
Lugemise aeg10:52 tundi
Arvutus põhineb keskmisel lugemiskiirusel, kus 200-250 sõna lugemiseks kulub 2 minutit.