Login / Signup

Number of colors needed to break symmetries of a graph by an arbitrary edge coloring.

Saeid AlikhaniMohammad Hadi Shekarriz
Published in: Art Discret. Appl. Math. (2022)
Keyphrases
  • small number
  • weighted graph
  • search engine
  • edge information
  • computational complexity
  • evolutionary algorithm
  • multi objective
  • random walk
  • undirected graph
  • graph theoretic
  • polynomial time complexity