Algorithms For Colouring Random K-Colourable Graphs.
C. R. SubramanianPublished in: Comb. Probab. Comput. (2000)
Keyphrases
- computational cost
- computationally efficient
- significant improvement
- data structure
- data sets
- optimization problems
- graph search
- random graphs
- graph mining
- graph theory
- recently developed
- directed graph
- theoretical analysis
- semi supervised
- computational complexity
- objective function
- reinforcement learning
- learning algorithm