Experiments on drawing 2-level hierarchical graphs

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.