1 citations · 1 across the 1 of their papers we have counts for
1 paper
Yanqing Hu, Zengru Di
Least box number coverage problem for calculating dimension of fractal networks is a NP-hard problem. Meanwhile, the time complexity of random ball coverage for calculating dimensi…