Parallel N-free order recognition
Abstract
Parallel algorithms for recognizing and representing N-free orders are proposed for different models of parallel random access machine (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 model and in constant time using n^2 processors in the CRCW PRAM model. Algorithms for distributed-memory machines are also proposed.
Origin : Files produced by the author(s)