Items related to Expected Parallel Time and Sequential Space Complexity...
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems (Classic Reprint) - Softcover
Synopsis
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.
"synopsis" may belong to another edition of this title.
Buy New
View this item
US$ 17.55
FREE shipping from United Kingdom to U.S.A.
Destination, rates & speedsOther Popular Editions of the Same Title
Search results for Expected Parallel Time and Sequential Space Complexity...
Seller Image
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
Quantity: Over 20 available
Stock Image
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems Classic Reprint
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332088898
Quantity: 15 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
Quantity: 15 available