Graph coloring via clique search with symmetry breaking

HIGHLIGHTS

• who: FSándor Szabó and Bogdán Zaválnij from the Rényi Institute of Mathematics, Budapest, Hungary have published the paper: Graph Coloring via Clique Search with Symmetry Breaking, in the Journal: Symmetry 2022, 14, 1574. of /2022/
• what: The authors explore the possibility of reducing the search space by exploiting the symmetries present in the auxiliary graph. The authors focus on the optimization problem of proper coloring of the nodes of a given graph with the minimum number of colors by reducing the coloring problem to a clique problem. Feeding graph (Γi )0 . . .
  

   

  

  If you want to have access to all the content you need to log in!

  Thanks :)

  Username or Email

  Password

  Remember me

  Lost your password?

  If you don't have an account, you can create one here.