Login / Signup

The graph tessellation cover number: Chromatic bounds, efficient algorithms and hardness.

Alexandre Santiago de AbreuLuís Felipe I. CunhaCelina M. H. de FigueiredoLuis Antonio Brasil KowadaFranklin L. MarquezinoDaniel PosnerRenato Portugal
Published in: Theor. Comput. Sci. (2020)
Keyphrases
  • small number
  • maximum number
  • random walk
  • similarity measure
  • color images
  • upper bound
  • semi supervised
  • connected components
  • sample complexity