A modified PSO with fuzzy inference system for solving the planar graph coloring problem
There are several optimization problems with number of feasible solution is polynomial bounded by the size of the given input instances. Graph Coloring is a classic NP-hard problem; hence, it is theoretically of great importance. Diverse applications of Graph Coloring have made the scientific commun...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 语言: | English |
| 出版: |
2010
|
| 主题: | |
| 在线阅读: | http://eprints.utm.my/id/eprint/16547/7/MostafaErfaniMFSKSM2010.pdf |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|