STABULUS: A technique for finding stable sets in large graphs with tabu search

This publication has 7 references indexed in Scilit:

• On generating all maximal independent sets
  Information Processing Letters, 1988
• Using tabu search techniques for graph coloring
  Computing, 1987
• Some experiments with simulated annealing for coloring graphs
  European Journal of Operational Research, 1987
• Finding a Maximum Clique in an Arbitrary Graph
  SIAM Journal on Computing, 1986
• Future paths for integer programming and links to artificial intelligence
  Computers & Operations Research, 1986
• A new backtracking algorithm for generating the family of maximal independent sets of a graph
  Computers & Mathematics with Applications, 1983
• A graph coloring algorithm for large scheduling problems
  Journal of Research of the National Bureau of Standards, 1979