Fig. 4From: Soft document clustering using a novel graph covering approachResults for random instances with n=100 nodes. The dotted plots show the upper bounds computed with the graph coloring heuristics SLF, GIS and Clique. The continues plots show the results of the Greedy ApproachBack to article page