Kód: 13530761
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 publ ... celý popis
Angličtina
10.92 €
Dostupnosť:
50 % šanca
Máme informáciu, že by titul mohol byť dostupný. Na základe vašej objednávky sa ho pokúsime do 6 týždňov zabezpečiť.
Zadajte do formulára e-mailovú adresu a akonáhle knihu naskladníme, zašleme vám o tom správu. Postrážime všetko za vás.
Nákupom získate 26 bodov
Anotácia knihy
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.
Parametre knihy
Zaradenie knihy Knihy po anglicky Mathematics & science Mathematics Calculus & mathematical analysis
10.92 €
Angličtina
Osobný odber Bratislava a 12744 dalších
Copyright ©2008-26 najlacnejsie-knihy.sk Všetky práva vyhradenéSúkromieCookies
24 miliónov titulov
Vrátenie do mesiaca
02/210 210 99 (8-15.30h)Nákupný košík ( prázdny )