Taming the Gerrymander—Statistical physics approach to Political Districting Problem
暂无分享,去创建一个
[1] H. Young. Measuring the Compactness of Legislative Districts , 1988 .
[2] G. Nemhauser,et al. Optimal Political Districting by Implicit Enumeration Techniques , 1970 .
[3] P. Lai,et al. Application of statistical mechanics to combinatorial optimization problems: The chromatic number problem andq-partitioning of a graph , 1987 .
[4] P. Anderson,et al. Application of statistical mechanics to NP-complete problems in combinatorial optimisation , 1986 .
[5] R. B. Potts. Some generalized order-disorder transformations , 1952, Mathematical Proceedings of the Cambridge Philosophical Society.
[6] Rosario N. Mantegna,et al. An Introduction to Econophysics: Contents , 1999 .
[7] Mark Newman,et al. Detecting community structure in networks , 2004 .
[8] T. Vicsek,et al. Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.
[9] R. Lourie,et al. The Statistical Mechanics of Financial Markets , 2002 .
[10] P. Lai,et al. q-partitioning of graphs with finite coordination number , 1988 .
[11] S. Nagel. Simplified Bipartisan Computer Redistricting , 1965 .
[12] G. Nemhauser,et al. An Optimization Based Heuristic for Political Districting , 1998 .