Code: 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 ... more
English
10.92 €
Availability:
50/50
We think title might be available. Upon your order we will do our best to get it within 6 weeks.
Enter your e-mail address and once book will be available,
we will send you a message. It's that simple.
You get 26 loyalty points
Book synopsis
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.
Book details
Book category Books in English Mathematics & science Mathematics Calculus & mathematical analysis
10.92 €
English
Collection points Bratislava a 12892 dalších
Copyright ©2008-26 najlacnejsie-knihy.sk All rights reservedPrivacyCookies
25788 collection points
Delivery 2.99 €
02/210 210 99 (8-15.30h)Shopping cart ( Empty )