Digrafo Aciclico Planar
Mostrando 1-1 de 1 artigos, teses e dissertações.
-
1. Algoritmos Paralelos para Extensão Linear em Digrafos Planares
This work main objective was to study and to detail a PRAM parallel algorithm to compute topological ordering of a planar acyclic digraph, proposed by Kao and Klein. It is not trivial to obtain a topological ordering of general acyclic digraphs. Kao and Klein showed that this ordering can only be achieved computing the digraph transitive closure. Concerning
Publicado em: 2006