Kontakt
Kako kupovati
Dostava
Savjetnik za kupnju
A Fast and Simple Algorithm for the Maximum Flow Problem (Classic Reprint)
Engleski
26 b
30 dana za povrat kupljenih proizvoda
Kupci su kupili i
/
Meki uvez
42.63
€
/
Meki uvez
25.41
€
/
Meki uvez
61.67
€
/
Meki uvez
21.56
€
/
Meki uvez
32.10
€
Excerpt from A Fast and Simple Algorithm for the Maximum Flow Problem Factor of log n for networks that are both non-sparse and non-dense without using any complex data structures. About the Publisher Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
Informacije o knjizi
Engleski
Kategorija
Poklonite ovu knjigu još danas
To je jednostavno
1 Dodajte knjigu u košaricu i odaberite isporuku kao poklon 2 Zauzvrat ćemo vam poslati kupon 3 Knjiga dolazi na adresu poklonoprimcaMoglo bi vas zanimati i
/
Meki uvez
9.41
€
/
Meki uvez
14.88
€
Dobar dan! Ja sam Libroamiko, vaš književni savjetnik.
Kako vam mogu pomoći?