Abstract-Coordination of relays in a meshed system is an iterative process. It involves finding a set of break point relays. In this paper, we propose a new polynomial time approximation algorithm for computation of the minimum break point relay set. In turn, procedure for computation of minimum break point relays requires systematic enumeration of all possible simple loops in the system. Therefore, we also propose a simple method for enumerating all possible loops. The advantages of proposed approach are (1) simplicity and (2) reduced computational complexity. Case studies on various topologies demonstrate the utility of the proposed approach.