Recognizing hyperelliptic graphs in polynomial time (Q5919531): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: ComputeTW / rank | |||
Normal rank | |||
Revision as of 06:54, 29 February 2024
scientific article; zbMATH DE number 7186702
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recognizing hyperelliptic graphs in polynomial time |
scientific article; zbMATH DE number 7186702 |
Statements
Recognizing hyperelliptic graphs in polynomial time (English)
0 references
6 April 2020
0 references
algorithms
0 references
gonality
0 references
reduction rules
0 references
treewidth
0 references
