Login / Signup

Almost partitioning 2?colored complete 3?uniform hypergraphs into two monochromatic tight or loose cycles.

Sebastián BustamanteHiêp HànMaya Stein
Published in: J. Graph Theory (2019)
Keyphrases
  • upper bound
  • lower bound
  • worst case
  • graph theory
  • data sets
  • database
  • neural network
  • learning algorithm
  • image processing
  • database systems
  • multiscale
  • partitioning algorithm
  • color regions