Research Article
Fast Parallel All-Subgraph Enumeration Using Multicore Machines
Algorithm 4
Ordered labeling algorithm.
Input: A subgraph represented with its adjacency matrix | Output: A binary string of length as the ordered labeling for | () let be a list of vertices, and initially | () for each vertex do: | (a) insert to | () sort by degree of each vertex | () let be a lookup table and as the value associated to . | () for each vertex do: | (a) set equal to rank of in | () let be a binary matrix of size filled with zeros | () for each in do: // denotes the element of matrix in row and column | (a) if then set to 1 | () return concatenation of rows of |
|