Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: There exists a large number of theoretical results concerning fast parallel algorithms for graph problems, hover, scarcely one finds reports of their practical implementation. In an attempt at partial filling this gap  discuss implementation of an algorithm performing the pretest for k-connectivity. This test is based, first, on the Scan-First Search algorithm introduced in [1]. Utilizing this procedure  decrease the size of the input graph by removing selected edges so that the resulting graph (certificate of k-connectivity) has only 0(kn) left. During this part of computations  can ansr the question about k-connectivity negatively if a certificate cannot be generated. Afterwards,  can apply the test described in [2] to establish ^-connectivity in the remaining cases.
['Przemysław Sokołowski', 'Paweł Konieczka', 'Jakub Sochacki', 'Marcin Paprzycki']
I am writing a research paper on a idea Parallel implementation of the k-connectivity test algorithm
[{"from": "human", "value": "I am writing a research paper on a idea Parallel implementation of the k-connectivity test algorithm"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: There exists a large number of theoretical results concerning fast parallel algorithms for graph problems, hover, scarcely one finds reports of their practical implementation. In an attempt at partial filling this gap  discuss implementation of an algorithm performing the pretest for k-connectivity. This test is based, first, on the Scan-First Search algorithm introduced in [1]. Utilizing this procedure  decrease the size of the input graph by removing selected edges so that the resulting graph (certificate of k-connectivity) has only 0(kn) left. During this part of computations  can ansr the question about k-connectivity negatively if a certificate cannot be generated. Afterwards,  can apply the test described in [2] to establish ^-connectivity in the remaining cases."}]