Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems Classic Reprint
John John
ISBN 10: 1332088899 ISBN 13: 9781332088898
Published by Forgotten Books, 2018
New
PAP
From
PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
AbeBooks Seller since 7 April 2005
This specific item is no longer available.
About this Item
Description:
New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332088898
Synopsis:
Excerpt from Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems
In another proposed machine model, the w - ram, simultaneous access to the same memory location is allowed for both read and write Operations. In the case of a simultaneous write attempt, exactly one processor succeeds but we make no assumption of which one succeeds. (see [shiloah, Vishkin, 80] and [goldschlager, 78] for similar models.)
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.
"About this title" may belong to another edition of this title.
Bibliographic Details
Title: Expected Parallel Time and Sequential Space ...
Publisher: Forgotten Books
Publication Date: 2018
Binding: PAP
Condition: New
Top Search Results from the AbeBooks Marketplace
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: 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. Seller Inventory # 9781332088898_0
Buy New
£ 13.43
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332088898
Buy New
£ 17.44
£ 3.29 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 15 available