The complexity of gerrymandering over graphs: paths and trees (Q5925552)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of gerrymandering over graphs: paths and trees |
scientific article; zbMATH DE number 7538577
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of gerrymandering over graphs: paths and trees |
scientific article; zbMATH DE number 7538577 |
Statements
The complexity of gerrymandering over graphs: paths and trees (English)
0 references
8 June 2022
0 references
0 references
