Algorithm 1: Node ranking based on information theory.

Data:Set with all node pressures, $\mathcal{A}$. The nodes in $\mathcal{A}$ will be placed in the ordered list $\mathcal{S}$ according to their importance (relevance/redundancy). During theprocess, $\tilde{\mathcal{S}}$ denotes the elements of $\mathcal{A}$ not yet added in $\mathcal{S}$. Result: Set with ordered node pressures, $\mathcal{S}$.  Initialization: ${\displaystyle \mathcal{S}\leftarrow \left[\underset{x\in \mathcal{A}}{\arg \max }{\mathrm{Rel}}_y\left(x\right)\right]}$  $\mathcal{S}\leftarrow \left[\mathcal{S},\tilde{\mathcal{S}}\right]$