Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A graph is called hidden if the edges are not explicitly given and edge probe tests are required to detect the presence of edges.  studies the k most connected vertices (kMCV) problem on hidden bipartite graphs, which has applications in spatial databases, graph databases, and bioinformatics. There is a prior work on the kMCV problem, which is based on the “2-vertex testing” model, i.e., an edge probe test can only reveal the existence of an edge beten two individual vertices.  study the kMCV problem, in the context of a more general edge probe test model called “group testing.” A group test can reveal whether there exists some edge beten a vertex and a group of vertices. If group testing is used properly, a single invocation of a group test can reveal as much information as multiple invocations of 2-vertex tests.  discuss the cases and applications where group testing could be used, and present an algorithm, namely, GMCV, that adaptively leverages group testing to solve the kMCV problem.
['Jianguo Wang', 'Eric Lo', 'Man Lung Yiu']
I am writing a research paper on a idea Identifying the Most Connected Vertices in Hidden Bipartite Graphs Using Group Testing
[{"from": "human", "value": "I am writing a research paper on a idea Identifying the Most Connected Vertices in Hidden Bipartite Graphs Using Group Testing"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: A graph is called hidden if the edges are not explicitly given and edge probe tests are required to detect the presence of edges.  studies the k most connected vertices (kMCV) problem on hidden bipartite graphs, which has applications in spatial databases, graph databases, and bioinformatics. There is a prior work on the kMCV problem, which is based on the \u201c2-vertex testing\u201d model, i.e., an edge probe test can only reveal the existence of an edge beten two individual vertices.  study the kMCV problem, in the context of a more general edge probe test model called \u201cgroup testing.\u201d A group test can reveal whether there exists some edge beten a vertex and a group of vertices. If group testing is used properly, a single invocation of a group test can reveal as much information as multiple invocations of 2-vertex tests.  discuss the cases and applications where group testing could be used, and present an algorithm, namely, GMCV, that adaptively leverages group testing to solve the kMCV problem."}]