首页> 外文会议>International Conference on Multimedia, Signal Processing and Communication Technologies >The graph coloring problem — Review of algorithms neural networks and a new proposal
【24h】

The graph coloring problem — Review of algorithms neural networks and a new proposal

机译:图形着色问题 - 算法与神经网络的回顾和新建议

获取原文

摘要

By virtue of its large range of applications, the graph coloring problem has received considerable research interest from mathematicians and engineers alike. Both algorithmic & hardware methods to color a graph subject to adjacency constraints have been explored resulting in a wide variety of options. The actual selection of any one of the software/hardware methods would depend on the specific requirements of a particular application. This paper reviews the major developments that have occurred both in the algorithmic and the hardware domains pertaining to the solution of the gaph coloring problem. Further, a new neural circuit employing non-linear feedback in the form of unipolar comparators is presented which is able to color a graph more effectively than other existing neural networks for the same task. PSPICE simulations confirm the validity of the approach.
机译:凭借其大量应用,图形着色问题已从数学家和工程师获得相当大的研究兴趣。已经探讨了算法和硬件方法,以探讨邻接约束的图形,从而导致各种各样的选项。任何一个软件/硬件方法的实际选择将取决于特定应用程序的特定要求。本文审查了算法和硬件域中发生的主要开发,与Gaph着色问题的解决方案有关。此外,提出了一种以单极比较器形式采用非线性反馈的新神经电路,其能够比其他任务的其他现有神经网络更有效地彩色图。 PSPICE模拟确认了方法的有效性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号