Dynamic Modeling of Political Districting Problem

Author

Wang De ; Liu Jing ; Zhou Zhi-peng

Author_Institution

Dept. of Comput. Sci., Jinan Univ., GuangZhou, China

fYear

2009

fDate

11-13 Dec. 2009

Firstpage

1

Lastpage

4

Abstract

Our model is a dynamic network model to the political districting problem. Firstly, we map counties in the state to points in the county-based network. Using depth first search (DFS) algorithm and breadth-first search (BFS) algorithm, we guarantee the continuity and compactness of each district. Also we introduce and use grid-based method to divide counties. Finally, we illustrate this model by districting New York State and get such results: the total number of counties to be divided is 17. The average times dividing each county is 0.69. statistical properties of the model are also studied.

Keywords

politics; statistical analysis; tree searching; BFS algorithm; DFS algorithm; New York State; breadth-first search; county-based network; depth first search; dynamic network model; grid-based method; political districting problem; statistical property; Assembly; Computer science; Geographic Information Systems; Iterative methods; Mathematical model; Mathematics; Nominations and elections; Physics; Search methods; Voting;

fLanguage

English

Publisher

ieee

Conference_Titel

Computational Intelligence and Software Engineering, 2009. CiSE 2009. International Conference on

Conference_Location

Wuhan

Print_ISBN

978-1-4244-4507-3

Electronic_ISBN

978-1-4244-4507-3

Type

conf

DOI

10.1109/CISE.2009.5365452

Filename

5365452