Category: GraphLayout
Organization: Department of Computer Science, Queensland
        University, Qld., Australia
Journal: Journal of Information Processing
Comment: directed graph(digraph)を描く手法。審美基準は{(1)上
        向き矢印がない(2)ノードが均一に分布(3)線の交叉がない}
        となっている。このためのアルゴリズムは、{(1)ループを
        除去(2)いくつかの層にノードをふりわけ..このとき離れ
        た層間のアークにはダミーノードを付加(3)交叉がないよ
        う各層内のノードを並べかえ(4)ダミーノードを含むアー
        クがなるべくまっすぐなようにする}となっており、それ
        ぞれNP困難なのでヒューリスティックを使う。
Abstract: Several recent tools for visualizing software and
        information engineering problems have used directed
        graphs as a basic model. This has generated
        considerable interest in algorithms for drawing
        directed graphs that are easy to understand and
        remember. The paper discusses a practical and
        general method for making drawings according to
        specific aesthetic criteria. Some recent algorithms
        for drawing directed graphs are instances of this
        general method. The aesthetic criteria can be viewed
        as goals of optimization problems. Each step of the
        general method aims to meet one of the criteria by
        solving these optimization problems. The current
        state of knowledge of each of the optimization
        problems and is surveyed and unsolved problems are
        indicated
Number: 4
Bibtype: Article
Author: P. Eades
        K. Sugiyama
Pages: 424-437
Title: How to draw a directed graph
Year: 1990
Volume: 13
Keyword: computer graphics, directed graphs, optimisation,
        drawing algorithms, directed graph, aesthetic
        criteria, goals, optimization problems