Heuristics for the min–max arc crossing problem in graphs
作者:
Highlights:
• A heuristic method to improve the readability of graphs.
• A crossing reduction method for graph drawing expert systems.
• A mathematical programming formulation for the min–max arc crossing problem.
• An empirical comparison with the best existing method, including expert systems.
• Extensive computational results and statistical testing to compare methods.
摘要
•A heuristic method to improve the readability of graphs.•A crossing reduction method for graph drawing expert systems.•A mathematical programming formulation for the min–max arc crossing problem.•An empirical comparison with the best existing method, including expert systems.•Extensive computational results and statistical testing to compare methods.
论文关键词:Graph drawing expert system,Metaheuristics,Crossing reduction,Iterated greedy
论文评审过程:Received 6 September 2017, Revised 31 January 2018, Accepted 9 May 2018, Available online 15 May 2018, Version of Record 26 May 2018.
论文官网地址:https://doi.org/10.1016/j.eswa.2018.05.008