sbarakat / graph-partitioningLinks
This repository contains research into the use of graph partitioning algorithms for assigning people shelters based on their social networks in disaster areas.
☆18Updated 6 years ago
Alternatives and similar repositories for graph-partitioning
Users that are interested in graph-partitioning are comparing it to the libraries listed below
Sorting:
- An implementation of "EdMot: An Edge Enhancement Approach for Motif-aware Community Detection" (KDD 2019)☆133Updated 3 years ago
- Graph Partitoning Using Graph Convolutional Networks☆67Updated 3 years ago
- Implementation of Kernighan-Lin graph partitioning algorithm in Python☆50Updated 6 years ago
- A NetworkX implementation of Label Propagation from a "Near Linear Time Algorithm to Detect Community Structures in Large-Scale Networks"…☆125Updated 3 years ago
- ☆174Updated 6 years ago
- ☆144Updated 4 years ago
- Implementation of the paper "Community Detection with Graph Neural Networks", [1] in Pytorch☆35Updated 8 years ago
- ☆72Updated 2 years ago
- Graph partitioning for distributed GNN training☆14Updated 2 years ago
- Python toolbox to evaluate graph vulnerability and robustness (CIKM 2021)☆163Updated 3 years ago
- ☆24Updated 3 years ago
- DynaMo: Dynamic Community Detection by Incrementally Maximizing Modularity☆29Updated 4 years ago
- LEMON: A local algorithm for fast, high-precision overlapping community detection☆55Updated 8 years ago
- GraphZoom: A Multi-level Spectral Approach for Accurate and Scalable Graph Embedding (ICLR'20 Oral)☆114Updated 2 years ago
- A general-purpose, distributed graph random walk engine.☆109Updated 2 years ago
- Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.☆164Updated 5 years ago
- Visualization tool for Graph Neural Networks☆257Updated 3 years ago
- Some overlapping community detection algorithms (Until 2016). by Yulin Che (https://github.com/CheYulin) for the PhD qualification exam (…☆211Updated 3 years ago
- Distance Encoding for GNN Design☆188Updated 4 years ago
- FORA: Simple and Effective Approximate Single-Source Personalized Pagerank☆32Updated 4 years ago
- ☆217Updated 2 years ago
- An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)☆69Updated 3 years ago
- A collection of resources on dynamic/streaming/temporal/evolving graph processing systems, databases, data structures, datasets, and rela…☆144Updated 2 years ago
- GraMi is a novel framework for frequent subgraph mining in a single large graph, GraMi outperforms existing techniques by 2 orders of ma…☆118Updated 2 years ago
- Supervised community detection with line graph neural networks☆90Updated 5 years ago
- Scalable Graph Neural Networks for Heterogeneous Graphs☆72Updated 5 years ago
- A NetworkX implementation of "Ego-splitting Framework: from Non-Overlapping to Overlapping Clusters" (KDD 2017).☆84Updated 2 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆88Updated 6 years ago
- Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.☆214Updated 5 years ago
- ☆14Updated 4 years ago