🕸️ Graphs, finite fields and discrete dynamical systems in Kotlin
-
Updated
Jul 3, 2024 - Kotlin
🕸️ Graphs, finite fields and discrete dynamical systems in Kotlin
A Python Graph Matching Toolkit.
Official Github for "PharmacoNet: Accelerating Large-Scale Virtual Screening by Deep Pharmacophore Modeling" (NeurIPS 2023 Workshop)
A research protocol for deep graph matching.
Code and Data for the paper: Structure- and Function-Aware Substitution Matrices via Learnable Graph Matching (RECOMB 2024)
Tools to find the correspondences between vertices in different graphs.
Rematch: Robust and Efficient Matching of Local Knowledge Graphs for Improved Structural and Semantic Similarity
Graph-Based Image Matching System
[CVPR' 22 ORAL] SIGMA: Semantic-complete Graph Matching for Domain Adaptative Object Detection
A performant, powerful query framework to search for network motifs
[ICML 2023] Official code for our paper: 'Conditional Tree Matching for Inference-Time Adaptation of Tree Prediction Models'
A python implementation of Edmonds blossom algorithm for maximum-cardinality matching.
Laboratorio, algoritmos y demostraciones de la materia de Matemática Discreta II de la Licenciatura en Ciencias de la Computación de FAMAF (UNC)
This is the official code for the AISTATS 2023 paper "Learning Constrained Structured Spaces with Application to Multi-Graph Matching"
A platform to facilitate automized inter-hospital kidney transplants.
Compressed Sensing project - ENSAE ParisTech
A Python/Cython package for graph edit distances and graph matching
Graph matching and clustering by comparing heat kernels via optimal transport.
VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs
Add a description, image, and links to the graph-matching topic page so that developers can more easily learn about it.
To associate your repository with the graph-matching topic, visit your repo's landing page and select "manage topics."