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:
- Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.☆164Updated 5 years ago
- A NetworkX implementation of Label Propagation from a "Near Linear Time Algorithm to Detect Community Structures in Large-Scale Networks"…☆126Updated 3 years ago
- A collection of resources on dynamic/streaming/temporal/evolving graph processing systems, databases, data structures, datasets, and rela…☆145Updated 2 years ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆26Updated 3 years ago
- 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
- Planetoid datasets. Consist of Cora, Pubmed, Citeseer, Large_Cora, nell.0.1, nell.0.01, nell.0.001.☆13Updated 6 years ago
- FORA: Simple and Effective Approximate Single-Source Personalized Pagerank☆32Updated 5 years ago
- ☆174Updated 6 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…☆119Updated 2 years ago
- A general-purpose, distributed graph random walk engine.☆110Updated 2 years ago
- KDD Course Project - Implementation of Community Detection Algorithms and Evaluations and Some Datasets (港科博一时候KDD课程作业) - by Shixuan Sun …☆42Updated 7 years ago
- ☆24Updated 3 years ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆164Updated 2 years ago
- LEMON: A local algorithm for fast, high-precision overlapping community detection☆55Updated 8 years ago
- ☆144Updated 4 years ago
- Implementation of Kernighan-Lin graph partitioning algorithm in Python☆50Updated 6 years ago
- Multiple Local Community Detection☆17Updated 8 years ago
- Worked with a number of real-world datasets available at http://snap.stanford.edu/ to identify the importance of certain nodes in terms o…☆11Updated 9 years ago
- Implementation of the paper "Community Detection with Graph Neural Networks", [1] in Pytorch☆35Updated 8 years ago
- A software package for one-pass Vertex-cut balanced Graph Partitioning.☆32Updated 10 years ago
- ☆14Updated 4 years ago
- DynaMo: Dynamic Community Detection by Incrementally Maximizing Modularity☆29Updated 4 years ago
- Python implementation of frequent subgraph mining algorithm gSpan. Directed graphs are supported.☆214Updated 5 years ago
- Tutorial for Graph AutoEncoder implemented by TensorFlow 1.x and 2.x☆42Updated 5 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆88Updated 6 years ago
- An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)☆69Updated 3 years ago
- Data for the paper "Simplicial closure and higher-order link prediction"☆24Updated 7 years ago
- Code for generative hypergraph clustering via modularity-like objective functions.☆26Updated 3 years ago
- WWW21 - How Do Hyperedges Overlap☆20Updated last year