The following pages link to P. V. Sundar Balakrishnan (Q1127134):
Displaying 15 items.
- The forcing vertex detour monophonic number of a graph (Q322058) (← links)
- A maximin procedure for the optimal insertion timing of ad executions (Q1127135) (← links)
- Comparative performance of the FSCL neural net and \(K\)-means algorithm for market segmentation (Q1268170) (← links)
- (Q1901360) (redirect page) (← links)
- A study of the classification capabilities of neural networks using unsupervised learning: A comparison with \(K\)-means clustering (Q1901362) (← links)
- The connected vertex detour monophonic number of a graph (Q2361515) (← links)
- An investigation of mating and population maintenance strategies in hybrid genetic heuristics for product line designs (Q2566929) (← links)
- (Q2850080) (← links)
- Connected edge monophonic number of a graph (Q2862065) (← links)
- Edge Detour Monophonic Number of a Graph (Q2869854) (← links)
- (Q3394843) (← links)
- (Q3394844) (← links)
- (Q3394845) (← links)
- (Q3394846) (← links)
- The upper connected vertex detour monophonic number of a graph (Q6122440) (← links)
