Parallel N-free order recognition - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 1997

Parallel N-free order recognition


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.
Fichier principal
Vignette du fichier
tcs97.pdf (202.4 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00471609 , version 1 (08-04-2010)



Laurent Viennot. Parallel N-free order recognition. Theoretical Computer Science, 1997, 175, pp.393-406. ⟨10.1016/S0304-3975(96)00210-1⟩. ⟨inria-00471609⟩
76 View
79 Download



Gmail Facebook X LinkedIn More