On Edge Control Set of a Graph in Transportation Problems

One of the most significant problems in the analysis of the reliability of multi-state transportation systems is to find the minimal cut sets and minimal edge control sets. For that purpose there are several algorithms that use the minimal path and cut sets of such systems. In this paper we give an approach to determine the minimal edge control set. This approach directly finds all minimal edge control sets of a transport network. The main aim of the paper is to find optimal locations for sensors for detecting terrorists, weapons, or other dangerous materials on roads leading into major cities.