# Complexity of computing a v-reduced divisor in multigraphs

Is there a polynomial algorithm for computing a $v_0$-reduced divisor equivalent to a given divisor of an undirected multigraph?