A global reduction method for multidimensional size graphs

This paper introduces the concept of discrete multidimensional size function, a mathematical tool that studies particular graphs called size graphs. A global method for reducing size graphs and a theorem, stating that discrete multidimensional size functions are invariant with respect to this reduction method, are shown. This result allows us to easly and fast compute discrete multidimensional size functions for applications.