Coverings of branched over iterated torus links appear naturally and very often in Algebraic Geometry. The natural graph-manifold structure of the exterior of an iterated torus link induces a graph-structure in the branched covers. In this paper we give an algorithm to compute valued graphs representing a branched cover given the monodromy representation associated to the covering. The algorithm is completely mechanized in order to be programmed, and can also be used for finding representation of groups of iterated torus links.

1980 Mathematics Subject Classification (1985 revision): 57M25.