| dc.contributor.author |
T.H., Anh |
|
| dc.contributor.author |
T.T.T., Giang |
|
| dc.contributor.author |
T.L., Vinh |
|
| dc.date.accessioned |
2011-05-10T04:24:14Z |
|
| dc.date.available |
2011-05-10T04:24:14Z |
|
| dc.date.issued |
2009 |
|
| dc.identifier.isbn |
9.78E+12 |
|
| dc.identifier.uri |
http://tainguyenso.vnu.edu.vn/jspui/handle/123456789/7394 |
|
| dc.description.abstract |
In this paper, we study the problem of graph coloring and propose a novel particle swarm
optimization (PSO) algorithm for it. We use the PSO evolutionary progress to improve a simple
deterministic greedy algorithm. The new algorithm can achieve a result that is better than known heuristic
algorithms do, as verified by an extensive simulation study. ??2009 IEEE. |
vi |
| dc.language.iso |
en |
vi |
| dc.publisher |
Proceedings - 2009 International Conference on Information Engineering and Computer Science, ICIECS 2009 |
vi |
| dc.subject |
Particle swarm optimization |
vi |
| dc.subject |
Graph coloring |
vi |
| dc.subject |
First-fit algorithm |
vi |
| dc.title |
A novel particle swarm optimization - Based algorithm for the graph coloring problem |
vi |
| dc.type |
Article |
vi |