Peter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Nagamochi. Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. Algorithmica, 44(1):1-32, 2006. [doi]
@article{EadesFLN06,
title = {Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs},
author = {Peter Eades and Qing-Wen Feng and Xuemin Lin and Hiroshi Nagamochi},
year = {2006},
doi = {10.1007/s00453-004-1144-8},
url = {http://dx.doi.org/10.1007/s00453-004-1144-8},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/EadesFLN06},
cites = {0},
citedby = {0},
journal = {Algorithmica},
volume = {44},
number = {1},
pages = {1-32},
}