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:
- 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
- CoreScope: Graph Mining Using k-Core Analysis - Patterns, Anomalies and Algorithms (ICDM'16 & KAIS'18)☆16Updated last year
- A Parallel Graphlet Decomposition Library for Large Graphs☆88Updated 6 years ago
- mixed membership stochastic block model☆13Updated 9 years ago
- LEMON: A local algorithm for fast, high-precision overlapping community detection☆55Updated 8 years ago
- Hypergraph Algorithms Package☆99Updated 2 years ago
- ☆144Updated 4 years ago
- ☆51Updated 9 years ago
- Graph kernels☆56Updated 2 months ago
- Programs to identify link communities in complex networks☆99Updated 5 years ago
- Algorithms for local community detection in networks☆26Updated 9 years ago
- Algorithms for learning network structure from effective resistances and other random-walk-based similarities.☆31Updated 8 years ago
- A package for computing Graph Kernels☆102Updated 2 years ago
- Python Benchmarking Framework for the Clustering Algorithms Evaluation: networks generation and shuffling; failover execution and resourc…☆19Updated 7 years ago
- Python implementation of Kohler et al.'s random walk with restart☆29Updated 7 years ago
- Community mining with Speaker-Listener Label Propagation Algorithm (SLPA) for networkx graphs☆28Updated 3 years ago
- Maximal Biclique Enumeration in Bipartite Graphs☆21Updated 5 years ago
- Tools for the generation, analysis and visualisation of complex networks in hyperbolic space.☆27Updated 7 years ago
- Implementation of the Louvain algorithm for community detection with various methods for use with igraph in python.☆255Updated last year
- OpenMP-based parallel software for computing the truss decomposition of a graph.☆14Updated 7 years ago
- Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures☆133Updated 4 years ago
- NetworkX Addon to allow graph partitioning with METIS☆80Updated 2 years ago
- OhmNet: Representation learning in multi-layer graphs☆84Updated 5 years ago
- Generalized Conventional Mutual Information (GenConvMI) - NMI for overlapping (soft, fuzzy) clusters (communities), compatible with stand…☆21Updated 5 years ago
- Dynamic Community Finding☆26Updated 7 years ago
- Implementation of the Multiscale Laplacian Graph Kernel☆19Updated 6 years ago
- Jupyter notebooks for examples in the paper "Higher-order organization of complex networks".☆40Updated 8 years ago
- ☆25Updated 7 years ago
- Efficient discovery of overlapping communities in massive networks PK Gopalan, DM Blei Proceedings of the National Academy of Sciences 11…☆73Updated 5 years ago
- Fast consensus clustering in networks☆22Updated last year