CTGCN: k-core based Temporal Graph Convolutional Network for Dynamic Graphs (accepted by IEEE TKDE in 2020) https://ieeexplore.ieee.org/document/9240056
-
Updated
May 31, 2023 - Python
CTGCN: k-core based Temporal Graph Convolutional Network for Dynamic Graphs (accepted by IEEE TKDE in 2020) https://ieeexplore.ieee.org/document/9240056
[ACM Computing Surveys'23] Implementations or refactor of some temporal link prediction/dynamic link prediction methods and summary of related open resources for survey paper "Temporal Link Prediction: A Unified Framework, Taxonomy, and Review" which has been accepted by ACM Computing Surveys.
High-Performance Streaming Graph Analytics on GPUs
Code for structural temporal graph neural networks for anomaly detection in dynamic graphs
A* ( Star) algorithm for dynamic graphs on GPU
Diverse Dense Correlated Subgraph Mining in Dynamic Networks
This repository contains a our work about the "Real-time Constrained Cycle Detection in Large Dynamic Graphs" paper, which present a GraphS system to efficiently detect constrained cycles in a dynamic graph, which is changing constantly, and return the satisfying cycles in real-time.
This repository contains a our work about the "How to Explore a Fast-Changing World" paper, where we cover the simple random walk on directed graphs and undirected graphs and the lazy random walk on dynamic graphs. In terms of the cover time.
This repositry contains GPU implemenation of Dynamic A* search algorithm
Goal of this academic project is to implement the Breadth First Search, Ford-Fulkerson Network flow algorithm and use it to solve the Circulation with Demands problem.
Sum Over Histories Representation.
Creating a dynamic directed multi-graph and performing various operations on it
Add a description, image, and links to the dynamic-graph-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the dynamic-graph-algorithm topic, visit your repo's landing page and select "manage topics."