Before revision:  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  .
After revision:  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 ; we further show intractability for a related but simpler problem .