The official implementation of NeurIPS22 spotlight paper "NodeFormer: A Scalable Graph Structure Learning Transformer for Node Classification"

The official implementation for ICLR23 spotlight paper "DIFFormer: Scalable (Graph) Transformers Induced by Energy Constrained Diffusion"

VF3 Algorithm - The fastest algorithm to solve subgraph isomorphism on large and dense graphs

The official implementation for ICLR23 paper "GNNSafe: Energy-based Out-of-Distribution Detection for Graph Neural Networks"

Out-of-GPU-Memory Graph Processing with Minimal Data Transfer

strange cross-platform, performance-oriented and interactive pangenome and large graph visualization

Graph Implementation in C using Adjacency List. This program can perform DFS, BFS and check if a given set is vertex cover of the graph.

An interactive web application for exploring and visualizing large graphs. It loads graphs serialized with Python’s pickle (NetworkX graphs), provides quick browsing of graph collections, and offers responsive visualization with cached computations for better performance.