research
∙
12/22/2021
An Efficient Pruning Process with Locality Aware Exploration and Dynamic Graph Editing for Subgraph Matching
Subgraph matching is a NP-complete problem that extracts isomorphic embe...
share
research
∙
12/18/2020
Fast and Efficient Parallel Breadth-First Search with Power-law Graph Transformation
In the big data era, graph computing is widely used to exploit the hidde...
research
∙
10/18/2020
