loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 International Conference on Scalable Computing and Communications; Eighth International Conference on Embedded Computing
Total Coloring Schemes and Algorithms of Regular Planar Meshes
Dalian, China
September 25-September 27
ISBN: 978-0-7695-3825-9
ASCII Text
x 
 
Deqiang Wang, Yupeng Wen, Kelun Wang, "Total Coloring Schemes and Algorithms of Regular Planar Meshes," Scalable Computing and Communications; International Conference on Embedded Computing, International Conference on, pp. 195-199, 2009 International Conference on Scalable Computing and Communications; Eighth International Conference on Embedded Computing, 2009.
 
 
BibTex
x
 
@article{ 10.1109/EmbeddedCom-ScalCom.2009.43,
author = {Deqiang Wang and Yupeng Wen and Kelun Wang},
title = {Total Coloring Schemes and Algorithms of Regular Planar Meshes},
journal ={Scalable Computing and Communications; International Conference on Embedded Computing, International Conference on},
volume = {0},
year = {2009},
isbn = {978-0-7695-3825-9},
pages = {195-199},
doi = {http://doi.ieeecomputersociety.org/10.1109/EmbeddedCom-ScalCom.2009.43},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Scalable Computing and Communications; International Conference on Embedded Computing, International Conference on
TI - Total Coloring Schemes and Algorithms of Regular Planar Meshes
SN - 978-0-7695-3825-9
SP195
EP199
A1 - Deqiang Wang,
A1 - Yupeng Wen,
A1 - Kelun Wang,
PY - 2009
KW - algorithm
KW - graph
KW - regular planar mesh
KW - total coloring
VL - 0
JA - Scalable Computing and Communications; International Conference on Embedded Computing, International Conference on
ER -
 
Square meshes, hexagonal meshes and honeycomb meshes are three classes of regular planar meshes, and they also are common interconnection architectures for multiprocessor systems. In this paper, we propose three optimum total coloring schemes which made these meshes have the smallest total coloring number --- maximum degree plus 1. And following these total coloring schemes, we also propose three efficient algorithms for total coloring these three regular planar meshes.
Index Terms:
algorithm, graph, regular planar mesh, total coloring
Citation:
Deqiang Wang, Yupeng Wen, Kelun Wang, "Total Coloring Schemes and Algorithms of Regular Planar Meshes," scalcom-embeddedcom, pp.195-199, 2009 International Conference on Scalable Computing and Communications; Eighth International Conference on Embedded Computing, 2009
Usage of this product signifies your acceptance of the Terms of Use.