Experiments on drawing 2-level hierarchical graphs
Experiments on drawing 2-level hierarchical graphs
复制标题
绘制2级层次图的实验
DOI：
10.1080/00207169008803941
复制
发表时间：
1990
期刊：
影响因子：
--
通讯作者：
E. Mäkinen
中科院分区：
文献类型：
--
作者：
E. Mäkinen
本文研究了两级层次图的不同绘制方法。特别是对重心法和中值法进行了比较。我们表明，barycctcr启发式明显优于中位数启发式，虽然只有后者有一个证明了两个顶点的顺序时所做的最大错误的范围。此外，我们改进了一个已知的启发式，称为贪婪切换，通过引入重心启发式作为它的预处理阶段。
This paper studies different heuristics for drawing 2-Ievel hierarchical graphs. Especially, we compare the barycenter and the median heuristics. We show that the baryccntcr heuristic clearly outperforms the median heuristic, although only the latter has a proved bound for the maximum error done when two vertices are ordered. Moreover, we improve a known heuristic, called the greedy switching, by introducing the barycenter heuristic as a preprocessing phase for it.