On the complexity of optimally modifying graphs representing spatial correlation in areal unit count data

10/20/2020

∙

by   Duncan Lee, et al.

∙

0

∙

share

Lee and Meeks recently demonstrated that improved inference for areal unit count data can be achieved by carrying out modifications to a graph representing spatial correlations; specifically, they delete edges of the planar graph derived from border-sharing between geographic regions in order to maximise a specific objective function. In this paper we address the computational complexity of the associated graph optimisation problem, demonstrating that it cannot be solved in polynomial time unless P = NP.