Contribution
Parallel N-free order recognition

https://doi.org/10.1016/S0304-3975(96)00210-1Get rights and content
Under an Elsevier user license
open archive

Abstract

Parallel algorithms for recognizing and representing N-free orders are proposed for different models of parallel random access machines (PRAM). The algorithms accept as input a transitively reduced directed graph with n vertices and m edges. They respectively run in time O(log n) using n + m processors in the EREW PRAM model and in constant time using n2 processors in the CRCW PRAM model. Algorithms for distributed-memory machines are also proposed.

Cited by (0)