A generalization of the Newton-Puiseux algorithm for semistable models

Paul Alexander Helminck

In this paper we give an algorithm that calculates the skeleton of a tame covering of curves over a complete discretely valued field. The algorithm relies on the {tame simultaneous…