版权说明 操作指南
首页 > 成果 > 详情

Drawing undirected graphs with genetic algorithms

认领
导出
Link by DOI
反馈
分享
QQ微信 微博
成果类型:
期刊论文、会议论文
作者:
Zhang, QG*;Liu, HY;Zhang, W;Guo, YJ
通讯作者:
Zhang, QG
作者机构:
[Zhang, W; Guo, YJ; Liu, HY; Zhang, QG] Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
通讯机构:
[Zhang, QG] C
Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
语种:
英文
期刊:
Lecture Notes in Computer Science
ISSN:
0302-9743
年:
2005
卷:
3612
期:
PART III
页码:
28-36
会议名称:
1st International Conference on Natural Computation (ICNC 2005)
会议论文集名称:
LECTURE NOTES IN COMPUTER SCIENCE
会议时间:
AUG 27-29, 2005
会议地点:
Changsha, PEOPLES R CHINA
会议主办单位:
Cent China Normal Univ, Dept Comp Sci, Wuhan 430079, Peoples R China.
会议赞助商:
Xiangtang Univ, IEEE Circuits & Syst Soc, IEEE Computat Intelligence Soc, IEEE Control Syst Soc, Int Neural Network Soc, European Neural Network Soc, Chinese Assoc Artificial Intelligence, Japanese Neural Network Soc, Int Fuzzy Syst Assoc, Asia Pacific Neural Network Assembly, Fuzzy Math & Syst Assoc China, Hunan Comp Federat
主编:
Wang, L Chen, K Ong, YS
出版地:
HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
出版者:
SPRINGER-VERLAG BERLIN
ISBN:
3-540-28320-X
机构署名:
本校为第一且通讯机构
院系归属:
计算机学院
摘要:
This paper proposes an improved genetic algorithm for producing aesthetically pleasing drawings of general undirected graphs. Previous undirected graph drawing algorithms draw large cycles with no chords as concave polygons. In order to overcome such disadvantage, the genetic algorithm in this paper designs a new mutation operator single-vertex- neighborhood mutation and adds a component aiming at symmetric drawings to the fitness function, and it can draw such type graphs as convex polygons. The improved algorithm is of following advantages: The method is simple and it is easy to be implement...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com