Presentation	1998/2/6 The algorithm for four-coloring map problems With maximum neuron model Yuji Yamada, Min Kang,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	We present a solution with maximum neuron model to four-coloring map problems. In the reported solutions to the problem, four neurons are used to express four colors in each region of a map and each region is colored with the color described by the neuron that its output is nonzero. It is a necessary condition that there exists only one neuron to which the output is nonzero for each region in the solutions. In maximum neuron model, the condition is always satisfied. We do simulations to five kinds of maps with 48-430 region and make a comparison between our results and the results by the reported method. It is shown that our solution is a very good method to the four-coloring map problem. Finally we discuss the update timing of neuron's output.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	four-coloring map problem / maximum neuron model / Hopfield neural network / local minimum
Paper #
Date of Issue

Conference Information
Committee	NLP
Conference Date	1998/2/6(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Nonlinear Problems (NLP)
Language	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	The algorithm for four-coloring map problems With maximum neuron model
Sub Title (in English)
Keyword(1)	four-coloring map problem
Keyword(2)	maximum neuron model
Keyword(3)	Hopfield neural network
Keyword(4)	local minimum
1st Author's Name	Yuji Yamada
1st Author's Affiliation	Kansai Jogakuin Women's College()
2nd Author's Name	Min Kang
2nd Author's Affiliation	Kansai Jogakuin Women's College
Date	1998/2/6
Paper #
Volume (vol)	vol.97
Number (no)	531
Page	pp.pp.-
#Pages	8
Date of Issue