JongikKim / NassLinks
☆14Updated last year
Alternatives and similar repositories for Nass
Users that are interested in Nass are comparing it to the libraries listed below
Sorting:
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆161Updated last year
- Released code for [sigmod'21] A learned Sketch for Subgraph Counting☆20Updated 4 years ago
- Source code and datasets of "An In-Depth Study of Continuous Subgraph Matching", accepted by VLDB'22 - By Xibo Sun, Dr. Shixuan Sun, Prof…☆50Updated 2 years ago
- Source Code for KDD 2020 paper "Neural Subgraph Isomorphism Counting"☆54Updated last year
- Official Implementation for "Scaling Attributed Network Embedding to Massive Graphs"☆18Updated last year
- FORA: Simple and Effective Approximate Single-Source Personalized Pagerank☆31Updated 4 years ago
- A Broader Picture of Random-walk Based Graph Embedding☆30Updated 4 years ago
- The code repository of paper "Computing Graph Edit Distance via Neural Graph Matching" for PVLDB 2023.☆25Updated 2 years ago
- PyTorch implementation of "Scalable Graph Neural Networks via Bidirectional Propagation"☆27Updated 4 years ago
- ☆144Updated 4 years ago
- The source code of "A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction"☆14Updated last year
- ☆213Updated last year
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆26Updated 3 years ago
- Dynamic graph/network dataset for dynamic graph/network embedding/representation☆36Updated 5 years ago
- Codes for our SIGIR'20 paper "BiANE: Bipartite Attributed Network Embedding".☆15Updated last year
- ☆27Updated 2 years ago
- Automatic feature extraction and node role assignment for transfer learning on graphs (ReFeX & RolX)☆88Updated last year
- Scalable Graph Neural Networks for Heterogeneous Graphs☆72Updated 4 years ago
- Simple and Fast State-of-Art Implementation of Influence Maximization Problem☆47Updated 6 years ago
- ☆138Updated 2 years ago
- [NeurIPS 2021] Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods☆125Updated 3 years ago
- A scalable graph learning toolkit for extremely large graph datasets. (WWW'22, 🏆 Best Student Paper Award)☆156Updated last year
- Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.☆208Updated 4 years ago
- ☆75Updated 3 years ago
- Code of GAMLP for Open Graph Benchmark. KDD‘22☆63Updated 3 years ago
- The source code of HeCo☆168Updated 3 years ago
- CTGCN: k-core based Temporal Graph Convolutional Network for Dynamic Graphs (accepted by IEEE TKDE in 2020) https://ieeexplore.ieee.org/…☆94Updated last month
- ☆61Updated 4 years ago
- Codes and data for KDD2020 submission☆17Updated 5 years ago
- The SEMB library is an easy-to-use tool for getting and evaluating structural node embeddings in graphs.☆18Updated 2 years ago