Explaining how to solve complex graph problems in parallel
Learn practical methods for ear-decomposition and st-numbering in graphs, with a focus on parallel algorithms and efficiency.
This book presents a concrete approach to transforming classical graph problems into parallel tasks. It shows how to build ear-decompositions, orient edges, and obtain valid numberings using scalable computation models.
- How ear-decomposition and open ear-decomposition relate to biconnected graphs
- Two-stage algorithms that produce valid st-numberings in parallel
- Techniques for orienting graphs and performing topological sorts in parallel
- Analyses of time and processor counts for efficient parallel implementations
Ideal for readers with an interest in parallel graph algorithms, algorithm design, and theoretical computer science applications.