Complexity of computing a v-reduced divisor in multigraphs

From Egres Open
Jump to: navigation, search

Is there a polynomial algorithm for computing a [math]v_0[/math]-reduced divisor equivalent to a given divisor of an undirected multigraph?



  1. J. van Dobben de Bruyn, Reduced divisors and gonality in finite graphs, Bachelor's Thesis (2012) Link