Graph data representation and pre-processing for efficient parallel search tree traversal
Abstract:
One or more embodiments may provide the capability to enumerate maximal cliques of graph data by constructing and traversing a search tree through a single sequential pass on an adjacency list. The adjacency list may be generated so as to enable the at least one maximal clique to be generated in one single sequential pass.
Information query
Patent Agency Ranking
0/0