浏览全部资源
扫码关注微信
西安电子科技大学电子工程研究所
Published:1996
移动端阅览
[1]许进,张军英,保铮.基于Hopfield网络的图的着色算法[J].电子学报,1996(10):8-13+7.
许进, 张军英, 保铮. Graphic Coloring Algorithms Based on Hopfield Network[J]. Acta Electronica Sinica, 1996, (10).
[1]许进,张军英,保铮.基于Hopfield网络的图的着色算法[J].电子学报,1996(10):8-13+7. DOI:
许进, 张军英, 保铮. Graphic Coloring Algorithms Based on Hopfield Network[J]. Acta Electronica Sinica, 1996, (10). DOI:
应用Hopfield网络模型,系统地研究了图的正常k-顶点着色,正常k-边着色以及正常k-全着色的具体算法,建立了相应的数学理论,改进了此领域内的某些工作。
The proper vertex-coloring
edge-coloring and total-coloring of a graph are systematically analysed with a new construction of the energy funtion for Hopfield nueral network
the corresponding coloring alogrithms are introduced and the computer simulation as well as the coloring results are presented.
0
Views
195
下载量
22
CSCD
Publicity Resources
Related Articles
Related Author
Related Institution