.png){kind=icon}
返回
An efficient parallel algorithm for the minimum crossing number problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2004.09.005.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
An efficient parallel algorithm for the minimum crossing number problem is presented. The algorithm, which is designed to embed the edges of a graph such that the total number of crossings is minimized, is based on an improved Hopfield neural network in which the internal dynamics is modified to permit temporary increases of the energy function so that the network can escape from local minima. The proposed algorithm is tested on several complete graphs and the simulation results show that the proposed algorithm provides a high probability of finding optimal solutions. (c) 2005 Elsevier B.V. All rights reserved.
Keyword:
minimum crossing number problem
NP-complete problem
Hopfield neural network
internal dynamics
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
暂无机构信息
引用论文
Effect of Thapsigargin on the Contractile Response of the Normal and Obstructed Rabbit Urinary Bladder.png)
Pharmacology
PharmacologyIF0
PREAI
分享收藏Insulin Pump Therapy in Adolescents With Very Poor Glycemic Control During a 12-Month Cohort Trial
OAAI
OAAI分享收藏 没有更多内容
没有更多内容