Articles liés à Expected Parallel Time and Sequential Space Complexity...
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems (Classic Reprint) - Couverture souple
Synopsis
The digital edition of all books may be viewed on our website before purchase. Excerpt from Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems (Classic Reprint)
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.
Acheter neuf
Afficher cet article
EUR 19,01
EUR 1,06 expédition depuis Etats-Unis vers France
Destinations, frais et délaisAutres éditions populaires du même titre
Résultats de recherche pour Expected Parallel Time and Sequential Space Complexity...
Image d'archives
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems Classic Reprint
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781332088898
Quantité disponible : 15 disponible(s)
Image d'archives
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems Classic Reprint
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur LW-9781332088898
Quantité disponible : 15 disponible(s)
Image fournie par le vendeur
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph
impression à la demandeVendeur : Forgotten Books, London, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Paperback. Etat : New. Print on Demand. This book investigates how parallel algorithms, which solve complex mathematical problems by distributing them across thousands of processors working together, can be used to solve graph and digraph problems faster and more efficiently. The author presents a novel probabilistic connectivity algorithm to enhance the performance of parallel graph algorithms that is 0(loglog n) faster than previous methods even as the number of processors is decreased. The book also explores expected sequential space and time complexities in parallel graph and digraph algorithms, providing a comprehensive view of the subject. These techniques can also improve the efficiency of algorithms for minimum spanning trees, minimum cost paths, and graph isomorphism. 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 9781332088898_0
Quantité disponible : Plus de 20 disponibles