The complexity of gerrymandering over graphs: paths and trees (Q5918559): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2022.09.009
@@ Property / DOI: 10.1016/j.dam.2022.09.009 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2022.09.009
+Normal rank
@@ Property / OpenAlex ID @@
+W3129684758
@@ Property / OpenAlex ID: W3129684758 / rank @@
+Normal rank
@@ Property / cites work @@
+Bicolored graph partitioning, or: gerrymandering at its worst
+Normal rank
@@ Property / cites work @@
+On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Gerrymandering on graphs: computational complexity and parameterized algorithms
+Normal rank
@@ Property / cites work @@
+Algorithms for gerrymandering over graphs
@@ Property / cites work: Algorithms for gerrymandering over graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Editing graphs to satisfy degree constraints: a parameterized approach
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2022.09.009
@@ Property / DOI: 10.1016/J.DAM.2022.09.009 / rank @@
+Normal rank