Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems

This book explores the expected parallel time and sequential space complexity of various graph and digraph problems. It provides an in-depth analysis of algorithms designed to solve these problems, focusing on their efficiency in terms of both time and space. The work is aimed at researchers and students in computer science, mathematics, and related fields who are interested in the theoretical aspects of computation and algorithm design.

Key topics include graph theory, parallel processing, algorithm analysis, and computational complexity. The book offers a rigorous treatment of the subject, combining theoretical results with practical considerations. It serves as a valuable resource for understanding the fundamental limitations and possibilities of solving graph and digraph problems using parallel and sequential computing models.

This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact, and remains as true to the original work as possible. Therefore, you will see the original copyright references, library stamps (as most of these works have been housed in our most important libraries around the world), and other notations in the work.

This work is in the public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work.

As a reproduction of a historical artifact, this work may contain missing or blurred pages, poor pictures, errant marks, etc. Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant.