Although this optimality result has been achieved with the minimal routing algorithm OITURN for the 2D case, the worst-case throughput of OITURN degrades tremendously in higher dimensions. Other ...

In this paper, we present a greedy-based algorithm for matching UML class diagrams based on their lexical, internal, neighborhood similarity, and a combination of them. Additionally the paper ...