Wuu Yang  Home/Search
Context
Related
| nctu.edu.tw/~wuuyang/./pa...TREEDRAW.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: nctu.edu.tw/~wuuyang/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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 by a data-parallel algorithm. It takes O (height * log width ) time on width pro- ############################# This work was supported in part by National Science Council, Taiwan, R.O.C. under grants NSC 84-2213-E-009-043 and NSC... (Update)
Similar documents (at the sentence level):
33.1%: A Data-Parallel Algorithm for Minimum-Width Tree Layout - Yang (1998) (Correct)
Active bibliography (related documents): More All
0.3: Algorithms for Drawing Clustered Graphs - Feng (1997) (Correct)
0.2: Deriving Tidy Drawings of Trees - Gibbons (1995) (Correct)
0.2: Graphical Application and Visualization of Lazy Functional.. - Foubister (1995) (Correct)
Similar documents based on text: More All
0.2: Real-time Graphics - Andersson (2000) (Correct)
0.1: Translating an Existing Scientific Application from C to.. - Chaney, Crowl (1993) (Correct)
0.1: Efficient Compilation of High-Level Data Parallel Algorithms - Suciu, Tannen (1994) (Correct)
BibTeX entry: (Update)
@article{ yang98dataparallel,
author = "Wuu Yang",
title = "A Data-Parallel Algorithm for Minimum-Width Tree Layout",
journal = "Information Processing Letters",
volume = "67",
number = "1",
pages = "21-28",
year = "1998",
url = "citeseer.ist.psu.edu/yang95dataparallel.html" }
Citations (may not include all citations):275 The Science of Programming (context) - Gries - 1981
200 Data parallel algorithms (context) - Hillis, Steele - 1986 ACM DBLP
135 An Introduction to Parallel Algorithms (context) - Jaja - 1992 ACM
58 DAG---A program that draws directed graphs - Gansner, North et al. - 1988
48 Introduction to Parallel Computing (context) - Lewis, El-Rewini - 1992 ACM
31 Drawing dynamic trees (context) - Moen - 1990 ACM DBLP
27 Software---Practice and Experience (context) - Rowe, Davis et al. - 1987
15 Inductive methods for proving properties of programs (context) - Manna, Ness et al. - 1973 ACM DBLP
4 Graph visualization in software analysis (context) - Gansner, North et al. - 1992
4 Software---Practice and Experience (context) - Bloesch, of et al. - 1993
1 Computer and System Sciences 3 pp (context) - Manna, of - 1969
1 Software Engineering SE (context) - Wetherell, Shannon et al. - 1979
Documents on the same site (http://www.cis.nctu.edu.tw/~wuuyang/): More
Conditional Evaluation in Simple Multi-Visit Attribute-Grammar.. - Yang (1997) (Correct)
Mealy Machines Are A Better Model Of Lexical Analyzers - Yang (1996) (Correct)
A Data-Parallel Algorithm for Minimum-Width Tree Layout - Yang (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC