Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number.
Jeanette P. SchmidtPublished in: Discret. Math. (1987)
Keyphrases
- computational complexity
- small number
- machine learning algorithms
- polynomial time complexity
- neural network
- running times
- execution times
- recently developed
- times faster
- orders of magnitude
- higher order
- semi supervised
- computational cost
- significant improvement
- theoretical analysis
- benchmark datasets
- probabilistic model
- combinatorial optimization
- memory requirements
- graph theory
- image analysis
- optimal solution