# Is there an algorithm for listing all/minimum admissable sets in a graph that satisfies the backdoor criterion in Causal Inference?

I would like to know if there exists an algorithm for finding all/minimum admissible sets in a graph that satisfy the backdoor criterion as defined by Judea Pearl in his book Causality (Please see here).