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
An Efficient and Balanced Graph Partition Algorithm for the Subgraph-Centric Programming Model on Large-scale Power-law Graphs
The subgraph-centric programming model is a promising approach and has b...
research
∙
02/27/2020
Improving the Performance of Stochastic Local Search for Maximum Vertex Weight Clique Problem Using Programming by Optimization
The maximum vertex weight clique problem (MVWCP) is an important general...
research
∙
06/14/2019
Utilizing the Instability in Weakly Supervised Object Detection
Weakly supervised object detection (WSOD) focuses on training object det...
research
∙
12/11/2018
DRONE: a Distributed Subgraph-Centric Framework for Processing Large Scale Power-law Graphs
Nowadays, in the big data era, social networks, graph databases, knowled...
research
∙
12/11/2018