Supergraph Topology Feature Index for Personalized Interesting Subgraph Query in Large Labeled Graphs

Algorithm 1

UBV(Size-c()) matching.

	Input: ECFIndex of query graph EQ, CES, number of interesting subgraph K
	Output: Top-K interesting subgraphs results R, the candidate matching heap CM
(1)	CM = NULL, R = NULL;
(2)	int CP, O[|EQ|];
(3)	O[0] ← First(CES);
(4)	O[ ] ← traverse EQfrom CES;
(5)	for each (traverse (ui, uj) in CES(O[0])) do
(6)	CP ← Size-c((ui, uj)) order by O[ ];
(7)	if (INT(Size-c())≤INT (R.bottom)) then
(8)	CM ← CP;
(9)	ascending (CM);
(10)	else then
(11)	CM ← R.bottom;
(12)	ascending (CM);
(13)	delete(R.bottom);
(14)	R ← CP;
(15)	descending (R);
(16)	return R, CM;