TABLE 4.

Pseudocode for unbalanced graphs (algorithm 3)^a

Step	Description
1	G ← original graph
2	K ← no. of subgraphs to generate
3	F ← no. of edges to subsample
4	R ← fraction of subgraphs where edges need to be stable
5	for k = 1 to K do
6	sample F edges from G to create g
7	if components in g are balanced then
8	for component in g do
9	$B\leftarrow$ apply algorithm 2 on component
10	end
11	$M[k]\leftarrow$ scoring matrix initialized from g
12	$M[k]\leftarrow M{[k]}^2$
13	$M[k]\leftarrow$ apply algorithm 1 on M[k]
14	for row, column in M[k] do
15	$M{[k]}_{\text{row,column}}\leftarrow M{[k]}_{\text{row,column}}+1/M{[k]}_{\text{row,column}}$
16	end
17	$M[k]\leftarrow$ apply algorithm 1 on M[k]
18	$M[k]\leftarrow M[k]+B$
19	$M[k]\leftarrow$ apply algorithm 1 on M[k]
20	end
21	O ← empty matrix
22	for row, column in M do
23	$p\leftarrow 0$
24	$n\leftarrow 0$
25	for k = 1 to K do
26	if $M{[k]}_{\text{row,column}}>0$ then
27	$p\leftarrow p+1$
28	else if $M{[k]}_{\text{row,column}}<0$ then
29	$n\leftarrow n+1$
30	if $p/K>R$ or if $n/K>R$ then
31	for k = 1 to K do
32	$O_{\text{row,column}}\leftarrow O_{\text{row,column}}+M{[k]}_{\text{row,column}}$
33	end
34	end
35	$O\leftarrow O/\text{max[abs}(O)]$

^aPseudocode operators “while,” “for,” “if,” “or,” “else,” “then,” “do,” and “end” are highlighted in bold for clarity.