Simple but powerful graph library for Rust

An implementation of "EdMot: An Edge Enhancement Approach for Motif-aware Community Detection" (KDD 2019)

[ICLR 2022] Code for Graph-less Neural Networks: Teaching Old MLPs New Tricks via Distillation (GLNN)

[ICLR 2023] MLPInit: Embarrassingly Simple GNN Training Acceleration with MLP Initialization

Nebula-Algorithm is a Spark Application based on GraphX, which enables state of art Graph Algorithms to run on top of NebulaGraph and write back results to NebulaGraph.

A curated list of graph learning papers, articles, tutorials, slides and projects

Genetic Algorithm for the Maximum Clique Problem

Block-style programming environment for tackling graph structure and graph algorithm, based on MIT Scratch.

jgtextrank: Yet another Python implementation of TextRank

OpenGraph is an open-source graph processing benchmarking suite written in pure C/OpenMP.

unsupervised clustering, generative model, mixed membership stochastic block model, kmeans, spectral clustering, point cloud data

An SQL storage implementation for graph data structures.

A library to simulate DFAs and Probabilistic DFAs using context switching. This library provides a way to build and define the behavior of a graph. The client is able to define the function each vertex and edge of the graph make and how the graph transitions from one (the first valid edge) or to many states, as well as which states the graph sta…

Given network and commodity information this tool computes a feasible multi-commodity flow over time.

Graph Processing Framework that supports || OpenMP || CAPI

Kong is a tool to compute the concurrency relation of a Petri using nets reduction (polyhedral approach).

An algorithm to look for maximum "edge" biclique

WelshPowell algorithm animated with VisuAlgo

Benchmark for Maximum Edge biclique in a Bipartite Graph