The digital edition of all books may be viewed on our website before purchase. Excerpt from Improved Time Bounds for the Maximum Flow Problem
About the Publisher
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 errors may persist, however we consider it worth publishing due to the work's historical value.The digital edition of all books may be viewed on our website before purchase.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
EUR 105 expédition depuis Allemagne vers Etats-Unis
Destinations, frais et délaisGratuit expédition depuis Royaume-Uni vers Etats-Unis
Destinations, frais et délaisVendeur : Forgotten Books, London, Royaume-Uni
Paperback. Etat : New. Print on Demand. This book explores the maximum flow problem, a fundamental challenge in network optimization with applications in diverse fields such as transportation, logistics, and telecommunications. The author delves into various algorithms designed to solve this problem efficiently, tracing their development and comparing their strengths and weaknesses. The book provides a comprehensive overview of the maximum flow problem, from its origins and theoretical foundations to practical implementations and applications. It offers valuable insights into the evolution of algorithmic techniques, highlighting the trade-offs between time complexity, accuracy, and resource utilization. This book is a valuable resource for researchers, practitioners, and students interested in network optimization, graph theory, and algorithms. 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. N° de réf. du vendeur 9781332265114_0
Quantité disponible : Plus de 20 disponibles
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781332265114
Quantité disponible : 15 disponible(s)
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781332265114
Quantité disponible : 15 disponible(s)
Vendeur : Buchpark, Trebbin, Allemagne
Etat : Hervorragend. Zustand: Hervorragend | Sprache: Englisch | Produktart: Bücher. N° de réf. du vendeur 26075237/1
Quantité disponible : 1 disponible(s)