maxdan94 / Density-FriendlyLinks
C implementation of algorithms to find the Density-Friendly graph decomposition
☆11Updated 5 years ago
Alternatives and similar repositories for Density-Friendly
Users that are interested in Density-Friendly are comparing it to the libraries listed below
Sorting:
- A Parallel Graphlet Decomposition Library for Large Graphs☆88Updated 6 years ago
- CoreScope: Graph Mining Using k-Core Analysis - Patterns, Anomalies and Algorithms (ICDM'16 & KAIS'18)☆16Updated last year
- OpenMP-based parallel software for computing the truss decomposition of a graph.☆14Updated 7 years ago
- Graph kernels☆55Updated 3 years ago
- Tools for the generation, analysis and visualisation of complex networks in hyperbolic space.☆27Updated 7 years ago
- Local community detection code that implements the methods used in Think Locally, Act Locally: The Detection of Small, Medium-Sized, and …☆13Updated 7 years ago
- NetworkX Addon to allow graph partitioning with METIS☆80Updated 2 years ago
- ☆144Updated 4 years ago
- ☆51Updated 9 years ago
- Hypergraph Algorithms Package☆98Updated 2 years ago
- mixed membership stochastic block model☆13Updated 9 years ago
- Quickly compute all maximal cliques of a graph☆80Updated 7 years ago
- (PLEASE USE https://github.com/HanKruiger/tsNET) This is here for historical purpose only.☆10Updated 6 years ago
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆63Updated 4 years ago
- LEMON: A local algorithm for fast, high-precision overlapping community detection☆55Updated 8 years ago
- Generalized Conventional Mutual Information (GenConvMI) - NMI for overlapping (soft, fuzzy) clusters (communities), compatible with stand…☆21Updated 5 years ago
- A package for computing Graph Kernels☆104Updated 2 years ago
- Discovering Polarized Communities in Signed Networks☆13Updated 6 years ago
- Programs to identify link communities in complex networks☆98Updated 4 years ago
- Simulation of diffusion on hypergraphs☆36Updated 10 years ago
- Maximum clique computation over large sparse graphs☆23Updated 3 years ago
- Python code associated with the paper "A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening'' (NeurIPS, 2019)☆16Updated 5 years ago
- Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.☆163Updated 4 years ago
- Graph Neural Networks for Community Detection☆64Updated 5 years ago
- Implementation of the Multiscale Laplacian Graph Kernel☆19Updated 6 years ago
- Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures☆133Updated 4 years ago
- ☆12Updated 8 years ago
- node2vec implementation in C++☆53Updated 5 years ago
- Python Benchmarking Framework for the Clustering Algorithms Evaluation: networks generation and shuffling; failover execution and resourc…☆19Updated 6 years ago
- Algorithms for learning network structure from effective resistances and other random-walk-based similarities.☆31Updated 7 years ago