Isbn: 9781333481063 - an efficient parallel biconnectivity algorithm (classic reprint) (3 risultati)

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

Paperback. Condizione: 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.…