An algorithm for computing fractal dimension of rectifiable irregular graphs

Fractal dimension is a suitable tool for analyzing the nonlinear behaviour and state of the dynamical systems. The algorithms of fractal dimension methods have weak ability to the estimation of complexity in the irregular graphs. In this paper we propose a new algorithm based on the size measure relationship (SMR) method, quantifying the dimensional behaviour of irregular rectifiable graphs with minimum time complexity. The evidence for the suitability (equality with the nature of dimension) of the algorithm is presented.