Synopsis
This book presents a new, highly efficient, parallel algorithm for finding the blocks (biconnected components) of an undirected graph - an important problem in graph theory. The algorithm has a linear-time sequential implementation and parallel implementations with optimal speed-up, making it suitable for large-scale graph analysis. The author, an established expert in graph algorithms, provides a clear and comprehensive explanation of the algorithm, making the book accessible to both researchers and practitioners in the field. By delving into the intricacies of parallel graph algorithms, the book contributes to the ongoing development of efficient methods for analyzing complex data structures.
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for An Efficient Parallel Biconnectivity Algorithm (Classic...
Seller Image
An Efficient Parallel Biconnectivity Algorithm (Classic Reprint)
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. Print on Demand. This book presents a new, highly efficient, parallel algorithm for finding the blocks (biconnected components) of an undirected graph - an important problem in graph theory. The algorithm has a linear-time sequential implementation and parallel implementations with optimal speed-up, making it suitable for large-scale graph analysis. The author, an established expert in graph algorithms, provides a clear and comprehensive explanation of the algorithm, making the book accessible to both researchers and practitioners in the field. By delving into the intricacies of parallel graph algorithms, the book contributes to the ongoing development of efficient methods for analyzing complex data structures. 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 # 9781333481063_0
Buy New
US$ 17.29
Free Shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
An Efficient Parallel Biconnectivity Algorithm (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-9781333481063
Stock Image
An Efficient Parallel Biconnectivity Algorithm (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-9781333481063
Buy New
US$ 23.97
US$ 4.44 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 15 available
Seller Image
EFFICIENT PARALLEL BICONNECTIV
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Condition: New. KlappentextrnrnExcerpt from An Efficient Parallel Biconnectivity AlgorithmThis implementation uses a concurrent-read, exclusive write parallel ram (crew pram). This model differs.About the PublisherForgotten Books publish. Seller Inventory # 2148054734
Buy New
US$ 26.52
US$ 57.67 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available