Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Nowadays, e-government has emerged as a government policy to improve the quality and efficiency of public administrations. By exploiting the potential of new information and communication technologies, government agencies are providing a wide spectrum of online services. These services are composed of several b services that comply with ll defined processes. One of the big challenges is the need to optimize the composition of the elementary b services. ,  present a solution for optimizing the computation effort in b service composition. Our method is based on Graph Theory.  model the semantic relationship beten the involved b services through a directed graph. Then,  compute all shortest paths using for the first time, an extended version of the FloydWarshall algorithm.
['Hajar Elmaghraoui', 'Imane Zaoui', 'Dalila Chiadmi', 'Laila Benhlima']
I am writing a research paper on a idea Graph based E-Government web service composition
[{"from": "human", "value": "I am writing a research paper on a idea Graph based E-Government web service composition"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Nowadays, e-government has emerged as a government policy to improve the quality and efficiency of public administrations. By exploiting the potential of new information and communication technologies, government agencies are providing a wide spectrum of online services. These services are composed of several b services that comply with ll defined processes. One of the big challenges is the need to optimize the composition of the elementary b services. ,  present a solution for optimizing the computation effort in b service composition. Our method is based on Graph Theory.  model the semantic relationship beten the involved b services through a directed graph. Then,  compute all shortest paths using for the first time, an extended version of the FloydWarshall algorithm."}]