An Algorithm for Map Coloring Problem Based on Depth First Search

Fan Gao; Xiao Zheng Mai; Bing Liang Cui

doi:10.4028/www.scientific.net/AMR.424-425.480

Paper Titles

Review on Singular-Value-Decomposition-Based Digital Watermarking Algorithm in Combination with Image Features
p.452

Study on the Firing Table Compiling of a New Type of the Very Low Altitude Interception Device
p.464

Numerical Study on Double Layers Fragment Warhead under Asymmetrical Initiation
p.471

The Research on the Calculation Methods and the Influential Factors Analysis of the Mechanical Joint Persistence Ratio of Jointed Rock Mass
p.476

An Algorithm for Map Coloring Problem Based on Depth First Search
p.480

Bioinformatics Analysis of the Complete Nucleotide Sequence of the Duck Enteritis Virus (DEV) US2 Gene
p.484

The Optimization of EB Flatform with Dynamic Cache
p.488

Bioinformatics Analysis and Characteristics of US2 Protein Encoded by the Newly Identified US2 Gene of Duck Enteritis Virus
p.493

Framework of 3D Model Manufacturing Features Extraction Technology
p.498

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 424-425An Algorithm for Map Coloring Problem Based on...

An Algorithm for Map Coloring Problem Based on Depth First Search

Abstract:

From analyzing the characters of depth first search algorithm， we proposed a new map coloring algorithm. The proposed algorithm overcomes the disadvantage of other algorithms in the field of Map-coloring, and the results show that the proposed algorithms can solve the problem of coloring administrative map efficiently and obtain optimal solutions

You might also be interested in these eBooks

Advanced Research on Engineering Materials, Energy, Management and Control

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 424-425)

Pages:

480-483

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.424-425.480

Citation:

Cite this paper

Online since:

January 2012

Authors:

Fan Gao, Xiao Zheng Mai, Bing Liang Cui

Keywords:

Depth First Search Algorithm, Four Color Algorithm, Map Coloring Problem

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Appel K, Haken W. The solution of the four-color-map problem[J]. Scientific American，1977, (10): 108-121.

DOI: 10.1038/scientificamerican1077-108

Google Scholar

[2] Xinzhu Ding. Four-color theorem, of computer software, computer validation 2001 annual national-level examination at questions five senior programmer assessment[J]. Computer age，2002, (3): 17-18.

Google Scholar

[3] CHANG You-qu, XIAO Gui-yuan, ZENG Min. Exploration of Greedy Algorithm[J]. Journal of Chongqing Electric Power College, 2008，9(3): 40-47.

Google Scholar

[4] XINJIAN ZHOU, XIANGSUN ZHANG. Hopfield-type Neural Network For Solving "Four-Coloring Map Problems[J]. OR TRANSACTIONS, 1999，(3): 53-58.

Google Scholar

[5] . LIANG Shu-ming, LU Zhong-wu. Chaotic Neural Network Algorithm Based on Annealing Strategy for Solving Four-coloring Map Problem[J]. Journal of Wuhan University of Science and Technology(Natural Science Edition), 2006, (6): 165-169.

Google Scholar

[6] WANG Shu-dong, XU Jin, LIU Hui-xin. The Hybrid Genetic Algorithms for the Adjacent Strong Edge Coloring of Graphs[J]. Systems Engineering and Electronics, 2003, (5): 26-29.

Google Scholar

[7] HAN Yun, GUO Qingsheng. Hybrid Genetic Algorithm for Coloring Administrative Map[J]. Geomatics and Information Science of Wuhan University, 2007，(8): 748-751.

Google Scholar

[8] Mao Yunzhou. A Method for Solving Four Color Problem[J]. JOURNAL OF XUZHOU NORMAL UNIVERSITY(NATURAL SCIENCE EDITION), 1998，(4): 17-18.

Google Scholar

[9] Takefuji Y，Lee K C. Artificial Neural Networks for Four-Coloring Map Problem and for K-Color ability Problems[J]. IEEE Transactions on Circuits and Systems， 1991，38: 326-333s.

DOI: 10.1109/31.101328

Google Scholar