In the Strongly Connected Dominating-Absorbent Set problem (SCDAS), we are given a directed graph and asked to find a subset D of vertices such that the subgraph induced by D is strongly connected and every vertex not in ...