Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems (Classic Reprint) - Hardcover

John

9780656021130: Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems (Classic Reprint)

Hardcover

ISBN 10: 0656021136 ISBN 13: 9780656021130

Publisher: Forgotten Books, 2018

View all copies of this ISBN edition

0 Used

2 New

From US$ 32.37

Explore how parallel algorithms really perform on graphs and digraphs.

This book examines what you can expect on average when solving key graph problems with parallel machines, using random input models to guide the analysis.

In clear, accessible terms, it shows how expected running time and space behave across problems like connectivity, biconnected components, strong components, transitive closure, and shortest paths. The discussion ties together machine models, prior results, and new findings to explain practical performance patterns.

How the number of processors and time scale when solving graph problems in parallel
What random inputs reveal about average-case performance
Connections between parallel time, space use, and problem type (undirected vs. directed)
Projected performance for several foundational graph tasks, with emphasis on expectations rather than worst-case bounds

Ideal for readers of advanced algorithms or parallel computing who want a grounded view of what to expect in practice when using parallel methods on graphs and digraphs.

"synopsis" may belong to another edition of this title.