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:
Main Author: | Erfani, Mostafa |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2010
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/16547/7/MostafaErfaniMFSKSM2010.pdf http://eprints.utm.my/id/eprint/16547/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Planar Graphs And Coloring
by: Manogaran, Lavaneesvari
Published: (2010) -
Graph coloring heuristics for solving examination timetabling problem at Universiti Utara Malaysia
by: Abdul Rahman, Syariza, et al.
Published: (2014) -
A large neighbourhood search to solve capacitated planar location-allocation problem
by: Luis, Martino, et al.
Published: (2014) -
Mosaicking of torn image using graph algorithm and color pixel matching
by: Thorig, Ibrahim
Published: (2014) -
Velocity tentative PSO: An optimal velocity implementation based particle swarm optimization to solve traveling salesman problem
by: M. A. H., Akhand, et al.
Published: (2015)