Computing Alexander polynomials for arborescent links

Alexander polynomial was born one century ago, but explicit formulas have been found for only a few families of links. In this paper, we present an efficient method of computing Alexander polynomial for arborescent links. Applying this method, we express the Alexander polynomials of Montesinos links in terms of certain polynomials associated to rational tangles which can be computed recursively. Specifically, we deduce explicit closed formulas for all pretzel links.