Login / Signup

Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs.

Daniel CostaAlain HertzClivier Dubuis
Published in: J. Heuristics (1995)
Keyphrases
  • evolutionary algorithm
  • optimization problems
  • np complete
  • graph matching
  • genetic programming
  • application domains
  • vector space
  • evolutionary computation
  • bipartite graph
  • graph mining
  • graph theoretic
  • graph embedding