Verwandte Artikel zu A Fast and Simple Algorithm for the Maximum Flow Problem...
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
- VerlagForgotten Books
- Erscheinungsdatum2018
- ISBN 10 1332260799
- ISBN 13 9781332260799
- EinbandTapa blanda
- SpracheEnglisch
- Anzahl der Seiten36
- Kontakt zum HerstellerNicht verfügbar
Neu kaufen
Diesen Artikel anzeigen
EUR 19,09
EUR 0,82 für den Versand von USA nach Deutschland
Versandziele, Kosten & DauerWeitere beliebte Ausgaben desselben Titels
Suchergebnisse für A Fast and Simple Algorithm for the Maximum Flow Problem...
Beispielbild für diese ISBN
A Fast and Simple Algorithm for the Maximum Flow Problem (Classic Reprint)
Anbieter: PBShop.store US, Wood Dale, IL, USA
Verkäuferbewertung 5 von 5 Sternen
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781332260799
Anzahl: 15 verfügbar
Beispielbild für diese ISBN
A Fast and Simple Algorithm for the Maximum Flow Problem (Classic Reprint)
Anbieter: PBShop.store UK, Fairford, GLOS, Vereinigtes Königreich
Verkäuferbewertung 4 von 5 Sternen
PAP. Zustand: New. New Book. Shipped from UK. Established seller since 2000. Bestandsnummer des Verkäufers LW-9781332260799
Anzahl: 15 verfügbar
Foto des Verkäufers
A Fast and Simple Algorithm for the Maximum Flow Problem (Classic Reprint)
Print-on-DemandAnbieter: Forgotten Books, London, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Paperback. Zustand: 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. Bestandsnummer des Verkäufers 9781332260799_0
Anzahl: Mehr als 20 verfügbar