TimGA - A Genetic Algorithm for Drawing Undirected Graphs
暂无分享,去创建一个
[1] A. Markus. Experiments with genetic algorithms for displaying graphs , 1991, Proceedings 1991 IEEE Workshop on Visual Languages.
[2] Joe Marks,et al. A Parallel Genetic Algorithm for Network-Diagram Layout , 1991, ICGA.
[3] David Harel,et al. Drawing graphs nicely using simulated annealing , 1996, TOGS.
[4] Zbigniew Michalewicz,et al. Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.
[5] Thomas Ottmann,et al. Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.
[6] Zbigniew Michalewicz,et al. Genetic algorithms for drawing directed graphs , 1991 .
[7] E. Mäkinen,et al. Genetic algorithms for drawing bipartite graphs , 1994 .
[8] Zbigniew Michalewicz,et al. Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.
[9] Frank Harary,et al. Graph Theory , 2016 .
[10] David S. Johnson,et al. Crossing Number is NP-Complete , 1983 .
[11] Robert J. Cimikowski,et al. A neural-network algorithm for a graph layout problem , 1996, IEEE Trans. Neural Networks.