Bicolored graph partitioning, or: gerrymandering at its worst (Q967425): Difference between revisions

@@ Property / author @@
-Q967423
@@ Property / author: Q967423 / rank @@
-Normal rank
@@ Property / author @@
-Isabella Lari
@@ Property / author: Isabella Lari / rank @@
-Normal rank
@@ Property / author @@
-Federica Ricca
@@ Property / author: Federica Ricca / rank @@
-Normal rank
@@ Property / author @@
+Ronald I. Becker
@@ Property / author: Ronald I. Becker / rank @@
+Normal rank
@@ Property / author @@
+Isabella Lari
@@ Property / author: Isabella Lari / rank @@
+Normal rank
@@ Property / author @@
+Federica Ricca
@@ Property / author: Federica Ricca / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2009.06.016
+Normal rank
@@ Property / OpenAlex ID @@
+W2020848182
@@ Property / OpenAlex ID: W2020848182 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of partitioning graphs into connected subgraphs
+Normal rank
@@ Property / cites work @@
+Evaluation and Optimization of Electoral Systems
@@ Property / cites work: Evaluation and Optimization of Electoral Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4168622
@@ Property / cites work: Q4168622 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5692715
@@ Property / cites work: Q5692715 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3912822
@@ Property / cites work: Q3912822 / rank @@
+Normal rank