EXPERIMENTS ON DRAWING 2-LEVEL HIERARCHICAL GRAPHS

被引：18

作者：

MAKINEN, E

机构：

[1] University of Tampere, Department of Computer Science, Tampere, P.O. Box 607

来源：

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS | 1990年 / 36卷 / 3-4期

基金：

芬兰科学院;

关键词：

barycenter heuristic; edge crossing; Graph drawing; greedy switching; hierarchical graph; median heuristic;

D O I：

10.1080/00207169008803921

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

This paper studies different heuristics for drawing 2-level hierarchical graphs. Especially, we compare the barycenter and the median heuristics. We show that the barycenter 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. © 1990, Taylor & Francis Group, LLC. All rights reserved.

引用

页码：175 / 181

页数：7