Artificial Neural Networks for Four-Coloring Map Problems and K-Colorability Problems

Yoshiyasu Takefuji, Kuo Chun Lee

研究成果: Article査読

102 被引用数 (Scopus)

抄録

Coloring map problem. The map-coloring problem is defined that one wants to color the regions of a map in such a way that no two adjacent regions (that is, regions sharing some common boundary) are of the same color. This paper presents a parallel algorithm based on the McCulloch-Pitts binary neuron model and the Hopfield neural network. It is shown that the computational energy is always guaranteed to monotonically decrease with the Newton equation. A 4 X n neural array is used to color a map of n regions where each neuron as a processing element performs the proposed Newton equation. The capability of our system is demonstrated through a large number of simulation runs. The parallel algorithm is extended for solving the K-colorability problem. The computational energy is presented for solving a four.

本文言語English
ページ(範囲)326-333
ページ数8
ジャーナルIEEE transactions on circuits and systems
38
3
DOI
出版ステータスPublished - 1991 3月
外部発表はい

ASJC Scopus subject areas

  • 工学(全般)

フィンガープリント

「Artificial Neural Networks for Four-Coloring Map Problems and K-Colorability Problems」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル