Items related to A Fast and Simple Algorithm for the Maximum Flow Problem...
Synopsis
Excerpt from A Fast and Simple Algorithm for the Maximum Flow Problem
Due to Ford and Fulkerson [1956] Edmonds and Karp [1972] Dinic [1970] Karzanov [1974] Cherkasky [1977] Malhotra, Kumar and Maheshwari [1978] Galil [1980] Galil and Naamad Shiloach [1978] Shiloach and Vishkin [1982] Sleator and Tarjan [1983] Tarjan [1984] Gabow [1985] Goldberg [1985] Goldberg and Taxjan [1986] Chen'yan and Maheshwari [1987] Ahuja and Odin [1987] Ahuja, 0m and Tarjan [1987.
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.
"synopsis" may belong to another edition of this title.
- PublisherForgotten Books
- Publication date2024
- ISBN 10 1332260799
- ISBN 13 9781332260799
- BindingPaperback
- LanguageEnglish
- Number of pages34
Other Popular Editions of the Same Title
Search results for A Fast and Simple Algorithm for the Maximum Flow Problem...
Seller Image
A Fast and Simple Algorithm for the Maximum Flow Problem (Classic Reprint)
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. Print on Demand. This book introduces a groundbreaking algorithm for solving the maximum flow problem in a network, a problem at the heart of network theory with applications in operations research, engineering, and computer science. The author improves upon previous algorithms, including the prevalent Goldberg-Tarjan algorithm, by introducing a novel excess scaling technique. This approach significantly reduces the number of non-saturating pushes, leading to an improved time complexity of O(nm n2 log U), where U represents the upper bound on integral arc capacities. The algorithm becomes particularly efficient when U is polynomially bounded in n, outperforming existing approaches in such scenarios. Unlike complex layered network-based algorithms, this approach leverages distance labels, offering simplicity and ease of implementation. The book also discusses future directions and potential refinements to the algorithm, making it a valuable resource for researchers and practitioners seeking to optimize network flows. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Seller Inventory # 9781332260799_0
Quantity: Over 20 available
Stock Image
A Fast and Simple Algorithm for the Maximum Flow Problem (Classic Reprint)
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 4 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332260799
Quantity: 15 available