Figure 3.

The Essential Set (ES) Algorithm. The ES algorithm finds all essential vertices in a graph and removes their non-neighbors.

Eblen et al. BMC Bioinformatics 2012 13(Suppl 10):S5   doi:10.1186/1471-2105-13-S10-S5