Pinned Repositories
Crystal
Crystal is a novel method for distributed subgraph matching on very large graphs. Crystal outperforms existing methods by several orders of magnitude on very large graphs. The work was published on VLDB 2018 with title "Subgraph matching: on compression and computation".
DAF
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together
echarts
echarts相关
edge-disjoint-partitioning
Reproducing the SIGMOD paper "Graph Indexing for Shortest-Path Finding over Dynamic Sub-Graphs"
fair-inference-on-outcomes
GADDI
Directed version GADDI
graph-partitioning-algorithms
Multi-way graph partitioning algorithms: FMS (Fiduccia-Mattheyses-Sanchis), PLM (Partitioning by Locked Moves), PFM (Partitioning by Free Moves)
Graph_Partitioning_Research
METIS, LEOPARD, Balanced Label Propagation, Bayesian Sharding
PuLP
RI-DS
A subgraph isomorphism algorithm.
Shengsj's Repositories
Shengsj/Crystal
Crystal is a novel method for distributed subgraph matching on very large graphs. Crystal outperforms existing methods by several orders of magnitude on very large graphs. The work was published on VLDB 2018 with title "Subgraph matching: on compression and computation".
Shengsj/DAF
Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together
Shengsj/echarts
echarts相关
Shengsj/edge-disjoint-partitioning
Reproducing the SIGMOD paper "Graph Indexing for Shortest-Path Finding over Dynamic Sub-Graphs"
Shengsj/fair-inference-on-outcomes
Shengsj/GADDI
Directed version GADDI
Shengsj/graph-partitioning-algorithms
Multi-way graph partitioning algorithms: FMS (Fiduccia-Mattheyses-Sanchis), PLM (Partitioning by Locked Moves), PFM (Partitioning by Free Moves)
Shengsj/Graph_Partitioning_Research
METIS, LEOPARD, Balanced Label Propagation, Bayesian Sharding
Shengsj/PuLP
Shengsj/RI-DS
A subgraph isomorphism algorithm.
Shengsj/sheep
A scalable distributed graph partitioner. Ongoing research.
Shengsj/storm-scheduler
Code for paper "Workload scheduling in distributed stream processors using graph partitioning" by Lorenz Fischer and Abraham Bernstein
Shengsj/subgraph-matching
Shengsj/TTMF
TTMF: A Triple Trustworthiness Measurement Frame for Knowledge Graphs
Shengsj/vf3-parallel
A parallel version of VF3.