mcavus / Kernighan-Lin
Implementation of Kernighan-Lin graph partitioning algorithm in Python
☆50Updated 5 years ago
Alternatives and similar repositories for Kernighan-Lin:
Users that are interested in Kernighan-Lin are comparing it to the libraries listed below
- Graph Partitoning Using Graph Convolutional Networks☆65Updated 2 years ago
- This repository contains research into the use of graph partitioning algorithms for assigning people shelters based on their social netwo…☆18Updated 5 years ago
- ☆24Updated 4 years ago
- The project is trying to find the most influential group of nodes in a huge social network.(SUSTech AI lab3)☆22Updated 6 years ago
- GraphZoom: A Multi-level Spectral Approach for Accurate and Scalable Graph Embedding☆114Updated last year
- Community Detection in Graphs (master's degree short project)☆40Updated 2 years ago
- Source code for paper "Prioritized Restreaming Algorithms for Balanced Graph Partitioning".☆14Updated 2 months ago
- KDD Course Project - Implementation of Community Detection Algorithms and Evaluations and Some Datasets (港科博一时候KDD课程作业) - by Shixuan Sun …☆43Updated 6 years ago
- Simple and Fast State-of-Art Implementation of Influence Maximization Problem☆48Updated 5 years ago
- Code for the paper "Unsupervised Community Detection with Modularity-based Attention Model"☆36Updated 4 years ago
- Graph partitioning for distributed GNN training☆13Updated last year
- Code, datasets & supplementary for "Structural Patterns and Generative Models of Real-world Hypergraphs"☆31Updated 4 months ago
- DenseAlert: Incremental Dense-SubTensor Detection in Tensor Streams (KDD'17)☆18Updated 4 months ago
- Subgraph matching and isomorphisms in Python.☆27Updated 2 years ago
- The source codes for D2AGE model. Distance-aware DAG Embedding for Proximity Search on Heterogeneous Graphs.☆12Updated 7 years ago
- Code for benhcmarking 12 state-of-the-art methods in the field of Influence Maximization☆19Updated 8 years ago
- bipartite-graph-learning☆30Updated 5 years ago
- Graph Recurrent Networks with Attributed Random Walks☆28Updated last year
- ☆14Updated 6 years ago
- Code for NeurIPS'19 "Layer-Dependent Importance Sampling for Training Deep and Large Graph Convolutional Networks"☆76Updated 2 years ago
- ☆17Updated 4 years ago
- ☆14Updated last year
- ☆137Updated 4 years ago
- ☆8Updated 8 years ago
- The source code of kdd2019 project☆25Updated 4 years ago
- DynaMo: Dynamic Community Detection by Incrementally Maximizing Modularity☆27Updated 3 years ago
- Advancing GraphSAGE with A Data-driven Node Sampling☆26Updated 2 years ago
- A tensorflow implementation of CommunityGAN (Community Detection with Generative Adversarial Nets)☆79Updated 6 years ago
- ☆12Updated 6 years ago
- Top-K Influential Nodes in Social Networks: A Game Perspective (SIGIR'17)☆35Updated 11 months ago