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 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|