Algorithm 1 Greedy optimization.
$\mathit{n}=[n_1,\dots ,n_D]=\mathit{A}\mathrm{diag}\left({\mathbf{I}}_D\right)$	▹ Compute number of neighbors
$\mathbf{o}=[o_1,\dots ,o_D]=\mathrm{sort}\left(\mathit{n}\right)$	▹ Order by highest degree
$\mathit{c}\leftarrow \mathrm{random}$	▹ Initialize color vector
$u=0$	▹ Initialize iteration counter
${\overline{P}}_{\mathrm{out}}^{\left(u\right)}\leftarrow \sum P_{\mathrm{out}}^i\left(\mathit{c}\right)/M$	▹ Initialize average outage probability
repeat
$u\leftarrow u+1$	▹ Update iteration counter
for $d=1:D$do	▹ Iterate over nodes
$\mathit{c}\left(o_d\right)\leftarrow \mathcal{P}(W,o_d)$	▹ Compute color as indicated in Equation (46)
${\overline{P}}_{\mathrm{out}}^{\left(u\right)}\leftarrow \sum P_{\mathrm{out}}^i\left(\mathit{c}\right)/M$	▹ Update average outage probability
until${\overline{P}}_{\mathrm{out}}^{(u-1)}-{\overline{P}}_{\mathrm{out}}^{\left(u\right)}<\chi$ or $u>U$	▹ Stopping criteria