Stable gonality is computable
From MaRDI portal
Publication:5226830
zbMath1417.05234arXiv1801.07553MaRDI QIDQ5226830
Ragnar Groot Koerkamp, Marieke van der Wegen
Publication date: 1 August 2019
Full work available at URL: https://arxiv.org/abs/1801.07553
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (05C99)
Related Items (3)
Problems hard for treewidth but easy for stable gonality ⋮ Computing graph gonality is hard ⋮ Recognizing hyperelliptic graphs in polynomial time
This page was built for publication: Stable gonality is computable