A novel evolutionary formulation of the maximum independent set problem

Details A novel evolutionary formulation of the maximum independent set problem A novel evolutionary formulation of the maximum independent set problem

2003-09-22

arxiv.org/abs/cs/0309038v1

Journal of Combinatorial Optimization 8 (2004), 419-437

Computer Science

Neural and Evolutionary Computing

Scientific paper

10.1007/s10878-004-4835-9

We introduce a novel evolutionary formulation of the problem of finding a maximum independent set of a graph. The new formulation is based on the relationship that exists between a graph's independence number and its acyclic orientations. It views such orientations as individuals and evolves them with the aid of evolutionary operators that are very heavily based on the structure of the graph and its acyclic orientations. The resulting heuristic has been tested on some of the Second DIMACS Implementation Challenge benchmark graphs, and has been found to be competitive when compared to several of the other heuristics that have also been tested on those graphs.

Affiliated with

Also associated with

No associations

Rating

A novel evolutionary formulation of the maximum independent set problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A novel evolutionary formulation of the maximum independent set problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A novel evolutionary formulation of the maximum independent set problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-161043