%0 Journal Article
%T A New Graph Drawing Algorithm for Undirected Graphs<br>一个新的无向图画图算法
%A HUANG Jing-wei
%A KANG Li-shan
%A CHEN Yu-ping
%A <br>黄竞伟
%A 康立山
%A 陈毓屏
%J 软件学报
%D 2000
%I 
%X In this paper, the authors transform the problem of undirected graph drawing to the problem of function optimization, then use genetic algorithms to find approximate optimal solutions of the objective function, and thus obtain a general structure of undirected graph drawing algorithms. The characters of the new method are: the structures of the different graph drawing algorithms are the same, the difference exists only in the objective functions which reflect aesthetic criteria. The advantages of the method are: unified algorithms, simplicity, easy modification and parallelism, and it can be used to draw non-connected graphs directly.
%K Undirected graph
%K graph drawing
%K aesthetic criteria
%K algorithm
%K genetic algorithm<br>无向图
%K 画图
%K 美观准则
%K 算法
%K 遗传算法.
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=FACE42876D0322A4&yid=9806D0D4EAA9BED3&vid=708DD6B15D2464E8&iid=CA4FD0336C81A37A&sid=09E495F616948E78&eid=E22B6B8FE86DD8F9&journal_id=1000-9825&journal_name=软件学报&referenced_num=7&reference_num=5