Fig. 10From: Discovering top-weighted k-truss communities in large graphsExecution time of the proposed algorithms against Backward and WSLSA Algorithms while r = 10 and k is varyingBack to article page