A HEURISTIC SEARCH ALGORITHM FOR FINDING MAXIMUN INDEPENDENT SET OF GRAPHS
Jiang Wu · Computer Applications and Software · 1990
A heuristic searching algorithm is presented in this paper.This algorithmis valuable for solving the problems concerning with the maximun independent set,the minimun vertex cover,the minimun coloring,and the cliques of a graph.Thisalgorithm is intuitive and easy to be implemented in computers.