Fig. 4
From: BC tree-based spectral sampling for big complex network visualization
The KS values of the sampling quality metrics (Closeness, AND, Degree, CC) of graph samples. a, b: computed by \(BC\_SS\), SS, RE; c, d: \(BC\_SV\), SV, RV. The lower KS value means the better result. \(BC\_SS\) and SS (resp., \(BC\_SV\) and SV) perform highly better than RE (resp., RV) on all metrics