The Extended Algorithm of the Bipartite Graph Matching Semantic Web Service Discovery

In previous work, the ontology-based algorithm of bipartite graph matching semantic web service discovery was presented. But in these algorithms, the problem of finding augment path was not resolved very well. It will affect the recall rate and precision rate of web service discovery. In order to resolve these problems, this paper proposes an ontology-based bipartite graph matching semantic web service discovery algorithm, which extends the optimal bipartite graph matching algorithm. It uses the slack function to find the augment path in the equivalent sub graph. The algorithm also contributes to the improvement of the recall rate and precision rate of the service discovery.