Accuracy of the ball-covering approach for fractal dimensions of complex networks and a rank-driven algorithm.

Abstract

Minimum box-covering method is a basic tool to measure fractal dimension of a network but unfortunately belongs to a family of NP-hard problems. Finding more accurate approximation in a relative shorter time is an important problem and attracts considerable attention. In this paper, the accuracy of the ball-covering approach for fractal dimension is… (More)

Topics

  • Presentations referencing similar topics