Stable divisorial gonality is in NP

DOI10.1007/978-3-030-10801-4_8zbMath1444.68138arXiv1808.06921OpenAlexW2888716158MaRDI QIDQ5918977

Hans L. Bodlaender, Tom C. van der Zanden, Marieke van der Wegen

Publication date: 22 October 2020

Published in: SOFSEM 2019: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.06921

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (2)

Recognizing hyperelliptic graphs in polynomial time ⋮ Stable divisorial gonality is in NP

This page was built for publication: Stable divisorial gonality is in NP