Projects/Codes

More projects/codes can be found at my Github page: https://github.com/LijunChang

1. https://lijunchang.github.io/Cohesive_subgraph_book: implementation for algorithms presented in the monograph “Cohesive Subgraph Computation over Large Sparse Graphs (2018)”
   
   

2. https://lijunchang.github.io/Maximum-kPlex/: implementation for the maximum k-plex computation algorithm proposed in the paper “Efficient Maximum k-Plex Computation over Large Sparse Graphs (PVLDB’23)”
   
   

3. https://lijunchang.github.io/ECo-Decompose/: implementation for edge connectivity-based hierarchical graph decomposition algorithms proposed in the paper “A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition (PVLDB’22)”
   
   

4. https://lijunchang.github.io/Graph_Edit_Distance/: implementation for graph edit distance (GED) computation and verificationn algorithms proposes in the papers “Speeding Up GED Verification for Graph Similarity Search (ICDE’20)” and “Accelerating Graph Similarity Search via Efficient GED Computation (TKDE’22)”
   
   

5. https://lijunchang.github.io/MC-BRB/: implementation for maximum clique computation (over large sparse graphs) algorithms proposed in the paper “Efficient Maximum Clique Computation over Large Sparse Graphs (KDD’19)”
   
   

6. https://lijunchang.github.io/Near-Maximum-Independent-Set/: implementation for near-maximum independent set computation algorithms proposed in the paper “Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling (SIGMOD’17)”
   
   

7. https://lijunchang.github.io/pSCAN/: implementation for the fast and exact structural graph clustering algorithm proposed in the paper “pSCAN: Fast and exact structural graph clustering (ICDE’16)”
   
   

8. https://lijunchang.github.io/ModularDecomposition/: implementation for a linear time modular decomposition algorithm