Login / Signup

On the minimum number of bond-edge types and tile types: An approach by edge-colorings of graphs.

Simona BonviciniMargherita Maria Ferrari
Published in: Discret. Appl. Math. (2020)
Keyphrases
  • undirected graph
  • small number
  • computational complexity
  • case study
  • lower bound
  • evolutionary algorithm
  • np hard
  • edge detection
  • directed graph