Research Article
Building Integrated Ontological Knowledge Structures with Efficient Approximation Algorithms
for to do | for to do | push into a set ordered by the first element in descending order; | end for | end for | while do | ; | if adding does not form a cycle in then | adding to ; | integrate and into ; is a set of vertices including that form a connected component in .} | end if | end while | return ; |
|