Random hypergraph coloring algorithms and the weak chromatic number.
Jeanette Schmidt-PruzanEli ShamirEli UpfalPublished in: J. Graph Theory (1985)
Keyphrases
- computational complexity
- learning algorithm
- small number
- running times
- maximum number
- times faster
- significant improvement
- orders of magnitude
- memory requirements
- color images
- computationally expensive
- hypergraph model
- machine learning
- space requirements
- space complexity
- color information
- recently developed
- high order
- data mining algorithms
- machine learning algorithms
- worst case