Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:feature |
linear time complexity
ensures sibling subtrees are drawn apart minimizes drawing area minimizes edge crossings produces tidy tree drawings |
| gptkbp:field |
computer science
|
| https://www.w3.org/2000/01/rdf-schema#label |
Reingold–Tilford algorithm
|
| gptkbp:introducedIn |
1981
|
| gptkbp:namedAfter |
gptkb:Edward_M._Reingold
gptkb:John_S._Tilford |
| gptkbp:publishedIn |
gptkb:IEEE_Transactions_on_Software_Engineering
|
| gptkbp:relatedTo |
gptkb:tree
graph drawing tidy tree layout |
| gptkbp:usedFor |
drawing trees
|
| gptkbp:bfsParent |
gptkb:Buck_Reingold
|
| gptkbp:bfsLayer |
6
|