Building Integrated Ontological Knowledge Structures with Efficient Approximation Algorithms

Algorithm 1

HEURISTICMERGE(, , ).

push into queue ; {Integrating virtual roots of the two ontologies}

while     do

 ;

 for   children of on   do

  ;

  ;

  ;

  for   children of on   do

   if   is chosen then

    continue; {The subtree rooted at can only be chosen once for integration, as illustrated in Figure 3.}

   else

    identify vertex in the subtree rooted at such that ;

    if     then

     ;

     ;

     ;

    end if

   end if

  end for

  if     then

   break;

  else

   save merge pair in ;

   mark as chosen;

   push into queue ;

  end if

 end for

end while

return   ;