Research Article
[Retracted] Vulnerability Digging for Software-Defined Network Controller Using Event Flow Graph Analysis
Algorithm 2
Topk_FrequentSubGraphMining(
GS,
). | Inputs: event flow graph set GS, minimum frequency | | Outputs: frequency subgraph set S | (1) | Sort nodes and edges in GS by frequency | (2) | Remove nodes and edges with low frequency | (3) | Relabel the remained nodes and edges by frequency | (4) | all frequent 1-edge subgraph | (5) | Sort subgraphs in in DFS dictionary order | (6) | S | (7) | for each edge do | (8) | | (9) | Subgraph_Mining(GS, S, s) | (10) | GSGS – e | (11) | if | GS | < | (12) | break |
|