CTGCN: k-core based Temporal Graph Convolutional Network for Dynamic Graphs (accepted by IEEE TKDE in 2020) https://ieeexplore.ieee.org/document/9240056
-
Updated
Jun 15, 2026 - Python
GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — Build software better, together
#
dynamic-graph-algorithmHere are 14 public repositories matching this topic...Sort: Most stars
Sort options
CTGCN: k-core based Temporal Graph Convolutional Network for Dynamic Graphs (accepted by IEEE TKDE in 2020) https://ieeexplore.ieee.org/document/9240056
edge-classification network-embedding link-prediction dynamic-graph-algorithm graph-embedding graph-convolutional-network node-classification graph-neural-networks graph-representation-learning dynamic-graphs graph-neural-network dynamic-graph-embedding dynamic-graph-processing temporal-graph-networks graph-embedding-approaches graph-centrality-prediction
[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.
survey overview attention nmf link-prediction dynamic-graph-algorithm rnns weighted-graphs gnns inductive-learning dynamic-graphs temporal-link-prediction dynamic-graph-embedding dynamic-link-prediction
High-Performance Streaming Graph Analytics on GPUs
high-performance cuda graph-analytics graph-framework streaming-graph-processing dynamic-data-structure dynamic-graph-algorithm
Code for structural temporal graph neural networks for anomaly detection in dynamic graphs
A* ( Star) algorithm for dynamic graphs on GPU
gpu astar-algorithm dynamic-graph-algorithm gpu-accelerated-library dynamic-graphs astar-search-algorithm
Diverse Dense Correlated Subgraph Mining in Dynamic Networks
This repositry contains GPU implemenation of Dynamic A* search algorithm
Sum Over Histories Representation.
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 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.
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.
network-flow bfs-algorithm algorithms-and-data-structures dynamic-graph-algorithm circulation-with-demands ford-fulkerson-algorithm
Produs software care are ca scop diminuarea efectelor dezastrelor naturale sau tehnologice, simularea procesului de evacuare a populației din zonele afectate, precum și organizarea sistemului de asistență a persoanelor rănite
gis astar astar-algorithm traffic-analysis emergency-response traffic-management traffic-simulation dynamic-graph-algorithm emergency-services emergency-management dynamic-graphs dynamic-graph-embedding best-first-serach
Creating a dynamic directed multi-graph and performing various operations on it
Add this topic to your repoTo associate your repository with the dynamic-graph-algorithm topic, visit your repo's landing page and select "manage topics." |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |