New insights into fast maximum flow algorithms, with practical ideas for scaling and dynamic trees.

This work surveys improvements in time bounds for the maximum flow problem, focusing on the preflow framework and scaling techniques. It discusses how to move large amounts of flow quickly, and compares approaches that use careful vertex selection, scaling factors, and wave methods. The text also presents how dynamic trees can dramatically speed up computations by moving flow along paths instead of single arcs.

What you’ll experience
- A clear explanation of the preflow algorithm and its key constraints
- Details of scaling variants that aim to reduce total running time
- The use of dynamic trees to accelerate push operations and maintain structure
- Comparisons of different selection rules and their impact on performance

Ideal for readers of advanced algorithms, researchers, and students seeking a rigorous treatment of time bounds in network flow problems.

Forgotten Books publishes hundreds of thousands of rare and classic books.

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.

This text has been digitally restored from a historical edition. Some aesthetic errors may persist, however it has been deemed that any such will not detract from the work's significant historical value.

The digital edition of all books may be viewed on our website before purchase.

Our books are made to order. After purchase your chosen title will be specially printed. Due to the individual nature of the process, please allow 3-4 business days for printing before we can dispatch.