jamestrimble / ijcai2017-partitioning-common-subgraphLinks
Code and experiments for the paper "A Partitioning Algorithm for Maximum Common Subgraph Problems"
☆15Updated 5 years ago
Alternatives and similar repositories for ijcai2017-partitioning-common-subgraph
Users that are interested in ijcai2017-partitioning-common-subgraph are comparing it to the libraries listed below
Sorting:
- Graph Neural Networks for Quantum Chemistry☆127Updated 7 years ago
- Implementation of our CVPR 2021 paper "Combinatorial Learning of Graph Edit Distance via Dynamic Embedding".☆28Updated 3 years ago
- A graph matching library for Python☆209Updated last year
- ☆49Updated 6 years ago
- ☆152Updated 6 years ago
- Graph Cross Network☆48Updated 5 years ago
- Source code for From Stars to Subgraphs (ICLR 2022)☆71Updated last year
- ☆62Updated 5 years ago
- Implementation of Directional Graph Networks in PyTorch and DGL☆117Updated 4 years ago
- Source code for our AAAI paper "Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks".☆190Updated 3 years ago
- ☆37Updated 6 years ago
- ☆365Updated last year
- Rex Ying's Ph.D. Thesis, Stanford University☆41Updated 3 years ago
- Subgraph Neural Networks (NeurIPS 2020)☆203Updated 4 years ago
- Code of "Breaking the Limits of Message Passing Graph Neural Networks" paper published in ICML2021☆41Updated 4 years ago
- Edge-Conditioned Convolutions on Graphs☆230Updated 7 years ago
- Official repository for the paper "Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting" (TPAMI'22) https://arxi…☆103Updated 4 years ago
- ☆358Updated 3 years ago
- Implementation of a graph edit distance in python☆34Updated 6 years ago
- LDP for graph classification☆23Updated 6 years ago
- Implementation of "Explainability Methods for Graph Convolutional Neural Networks" from HRL Laboratories☆84Updated 4 years ago
- Code for the paper: "On the Bottleneck of Graph Neural Networks and Its Practical Implications"☆97Updated 3 years ago
- Implementation of the paper "NetGAN: Generating Graphs via Random Walks".