首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Edge crossing minimization algorithm for hierarchical graphs based on Genetic Algorithms
Authors:Shen Wei-xiang  Huang Jing-wei
Institution:1. College of Computer, Wuhan University, 430072, Wuhan, China
Abstract:We present an edge crossing minimization algorithm for hierarchical graphs based on genetic algorithms, and comparing it with some heuristic algorithms. The proposed algorithm is more efficient and has the following advantages: the frame of the algorithms is unified, the method is simple, and its implementation and revision are easy.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号