• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Expected Parallel Time and Sequential Space Complexity of Graph and Digraph Problems

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

Hardcover

General ComputersProgramming

ISBN10: 102418529X
ISBN13: 9781024185294
Publisher: Hutson Street Press
Published: May 22 2025
Pages: 48
Weight: 0.55
Height: 0.25 Width: 6.14 Depth: 9.21
Language: English

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.

1 different editions

Also available

Also in

Programming