Gerrymandering on graphs: computational complexity and parameterized algorithms (Q2670918)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7535989
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Gerrymandering on graphs: computational complexity and parameterized algorithms |
scientific article; zbMATH DE number 7535989 |
Statements
Gerrymandering on graphs: computational complexity and parameterized algorithms (English)
0 references
1 June 2022
0 references
gerrymandering
0 references
parameterized complexity
0 references
representative set
0 references
0 references
0 references
0 references
0 references
0.8932084441184998
0 references
0.8897214531898499
0 references
0.8388864994049072
0 references
0.7750504016876221
0 references
