ecrc / bebeca Goto Github PK

Hello, I come from a university in China, sorry to bother you!

I have studied your paper "A Benchmark for Betweenness Centrality Approximation Algorithms on Large Graphs" posted on the International Conference on Scientific and Statistical Database Management, in 2017.I am very grateful for the studies you have done, and I am very surprised by the performance of the RAND1, RAND2 and GSIZE algorithms in the paper.

But in the paper, the input parameters of RAND1-- "the number of pivots", the input "number_of_nodes" of RAND2 and the input parameter of GSIZE--" the id of the arbitrary node" cannot be found in the paper, also it is difficult to find related information in the project. I think these parameters are the key information for the performance of the algorithms, so could you offer some help?

thank you very much:)