Lijun Chang (LijunChang)

LijunChang

Geek Repo

0

following

0

stars

Company:University of Sydney

Location:Sydney, Australia

Home Page:LijunChang.github.io

Github PK Tool:Github PK Tool

Lijun Chang's repositories

Graph_Edit_Distance

Exact graph edit distance (GED) computation and verification

Language:C++License:MITStargazers:51Issues:6Issues:10

Cohesive_subgraph_book

Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"

Language:C++Stargazers:25Issues:3Issues:0

MC-BRB

Maximum clique computation over large sparse graphs

Language:C++License:GPL-3.0Stargazers:17Issues:2Issues:0

Near-Maximum-Independent-Set

Near-linear time algorithm for computing near-maximum independent set

pSCAN

Exact Structural Graph Clustering

Language:C++License:GPL-3.0Stargazers:10Issues:2Issues:0
Language:C++License:MITStargazers:4Issues:2Issues:0

ECo-Decompose

Edge Connectivity-based hierarchical graph Decomposition

Language:C++Stargazers:2Issues:2Issues:0

Maximum-kDC

Maximum k-Defective Clique Computation

Language:C++License:GPL-3.0Stargazers:1Issues:1Issues:0

TriC

Local Triangle Counting

Language:C++Stargazers:1Issues:2Issues:0

Cluster-Tric

TriC-based structural graph clustering

Language:C++Stargazers:0Issues:2Issues:0

dlbook_notation

LaTeX files for the Deep Learning book notation

Language:TeXStargazers:0Issues:1Issues:0
Language:C++License:GPL-3.0Stargazers:0Issues:0Issues:0
Language:HTMLStargazers:0Issues:2Issues:0
Language:C++License:GPL-3.0Stargazers:0Issues:0Issues:0

ModularDecomposition

Linear time implementation of modular decomposition for undirected graphs

License:GPL-3.0Stargazers:0Issues:2Issues:0