A data-parallel algorithm for minimum-width tree layout

The tree-layout problem is to compute the coordinates of nodes of a tree so that the tree, when drawn on a piece of paper, appeals to human understanding. The tree-layout problem, which seems inherently sequential at the first glance, can be solved with a data-parallel algorithm. It takes O( height...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Information processing letters Ročník 67; číslo 1; s. 21 - 28
Hlavný autor:	Yang, Wuu
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 16.07.1998 Elsevier Science Elsevier Sequoia S.A
Predmet:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer science; control theory; systems Data-parallel algorithms EREW Exact sciences and technology Information processing Information retrieval. Graph PRAM Studies Theoretical computing Tree layout Data-parallel algorithms Algorithms PRAM Tree layout EREW Parallel algorithms Computational complexity Graph theory
ISSN:	0020-0190, 1872-6119
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!