Recognizing hyperelliptic graphs in polynomial time (Q5919531): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2020.02.013 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3005621309 / rank | |||
Normal rank | |||
Revision as of 00:15, 20 March 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
