Recognizing hyperelliptic graphs in polynomial time
From MaRDI portal
Publication:5919531
DOI10.1016/j.tcs.2020.02.013zbMath1436.05105OpenAlexW3005621309MaRDI QIDQ5919531
Marieke van der Wegen, Hans L. Bodlaender, Gunther Cornelissen, Jelco M. Bodewes
Publication date: 6 April 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.02.013
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Computational aspects of gonal maps and radical parametrization of curves
- Treewidth computations. II. Lower bounds
- Gonality of expander graphs
- Chip-firing games on graphs
- Specialization of linear systems from curves to graphs (with an appendix by Brian Conrad)
- The Magma algebra system. I: The user language
- Dynamic algorithms for graphs of bounded treewidth
- Chip-firing games, potential theory on graphs, and spanning trees
- Computing graph gonality is hard
- Lifting harmonic morphisms. II: Tropical curves and metrized complexes
- Treewidth is a lower bound on graph gonality
- A combinatorial Li-Yau inequality and rational points on curves
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- A $c^k n$ 5-Approximation Algorithm for Treewidth
- Self-organized criticality
- New tools and results in graph minor structure theory
- Harmonic Morphisms and Hyperelliptic Graphs
- Sandpiles, Spanning Trees, and Plane Duality
- Characterization and Recognition of Partial 3-Trees
- Polynomial Bound for a Chip Firing Game on Graphs
- Some NP-Complete Problems Similar to Graph Isomorphism
- Monotonicity in graph searching
- Parallel Algorithms with Optimal Speedup for Bounded Treewidth
- Self-organized critical state of sandpile automaton models
- Sparse Graphs of High Gonality
- Stable gonality is computable
- Recontamination does not help to search a graph
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Graph isomorphism in quasipolynomial time [extended abstract]
- Recognizing hyperelliptic graphs in polynomial time
- Stable divisorial gonality is in NP
This page was built for publication: Recognizing hyperelliptic graphs in polynomial time
