The following pages link to Arun K. Jagota (Q1361081):
Displayed 15 items.
- Item:Q1361081 (redirect page) (← links)
- An adaptive, multiple restarts neural network algorithm for graph coloring (Q1268156) (← links)
- Performance of neural net heuristics for maximum clique on diverse highly compressible graphs (Q1361082) (← links)
- Neural network-based heuristic algorithms for hypergraph coloring problems with applications. (Q1414734) (← links)
- A range-compaction heuristic for graph coloring (Q1430046) (← links)
- (Q4267799) (← links)
- (Q4298723) (← links)
- (Q4677318) (← links)
- (Q4706492) (← links)
- Comparing a Hidden Markov Model and a Stochastic Context-Free Grammar (Q4801139) (← links)
- Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem (Q5284217) (← links)
- (Q5284560) (← links)
- (Q5687255) (← links)
- A generalization of maximal independent sets (Q5931790) (← links)
- Adaptive, restart, randomized greedy heuristics for maximum clique (Q5960736) (← links)