In barrier resilience problems, we are given a set of barriers and two points $s$ and $t$. The task is to ﬁnd the minimum number of barriers one has to remove such that there is a path between $s$ and $t$ that does not cross a barrier.

GET IN TOUCH WITH US

Room 712, CE Algorithms Lab P.O. Box 11155-9517, Tehran, Iran

Tel: +9821-6600-6675