Covering edges by cliques with regard to keyword conflicts and intersection graphs
Kellerman has presented a method for determining keyword conflicts and described a heuristic algorithm which solves a certain combinatorial optimization problem in…