Parallel strong orientation of an undirected graph
In the shared memory model, a parallel algorithm is presented to solve the following graph problem: find a strong orientation for a given undirected 2-connected graph. The algorithm runs in \(O(\log^ 2n)\) time on \(O(n^ 3)\) processors, where n is the number of points of the graph. If write conflicts are solved in a reasonable way, the time complexity can be lowered to O(log n).
scientific article; zbMATH DE number 3845068