P. V. Sundar Balakrishnan

Available identifiers

Publication	Date of Publication	Type
The upper connected vertex detour monophonic number of a graph	2024-03-01	Paper
https://portal.mardi4nfdi.de/entity/Q5151898	2021-02-22	Paper
https://portal.mardi4nfdi.de/entity/Q4598964	2017-12-15	Paper
The connected vertex detour monophonic number of a graph	2017-06-30	Paper
The forcing vertex detour monophonic number of a graph	2016-10-14	Paper
https://portal.mardi4nfdi.de/entity/Q5400877	2014-03-12	Paper
Edge Detour Monophonic Number of a Graph	2014-01-07	Paper
Connected edge monophonic number of a graph	2013-11-13	Paper
https://portal.mardi4nfdi.de/entity/Q2850080	2013-09-26	Paper
https://portal.mardi4nfdi.de/entity/Q3394843	2009-09-08	Paper
https://portal.mardi4nfdi.de/entity/Q3394844	2009-09-08	Paper
https://portal.mardi4nfdi.de/entity/Q3394845	2009-09-08	Paper
https://portal.mardi4nfdi.de/entity/Q3394846	2009-09-08	Paper
An investigation of mating and population maintenance strategies in hybrid genetic heuristics for product line designs	2005-09-29	Paper
A maximin procedure for the optimal insertion timing of ad executions	1999-05-25	Paper
Comparative performance of the FSCL neural net and \(K\)-means algorithm for market segmentation	1999-05-25	Paper
Genetic Algorithms for Product Design	1997-11-12	Paper
A study of the classification capabilities of neural networks using unsupervised learning: A comparison with \(K\)-means clustering	1995-12-11	Paper
https://portal.mardi4nfdi.de/entity/Q5553377	1965-01-01	Paper

This page was built for person: P. V. Sundar Balakrishnan