Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 2 of 2 for “"subgraph-enumeration"”.
-
High performance DFS-based subgraph enumeration on GPUs
Subgraph enumeration is an important problem in the field of Graph Analytics with numerous applications. The problem is provably NP-complete and requires sophisticated heuristics and highly efficient implementations to be feasible on problem sizes of realistic scales. Parallel solutions have shown …
-
Enhancements in high performance subgraph enumeration on graphics processors
Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2024-08-01