maxdan94 / Density-Friendly
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
- CoreScope: Graph Mining Using k-Core Analysis - Patterns, Anomalies and Algorithms (ICDM'16 & KAIS'18)☆16Updated 6 months ago
- Local community detection code that implements the methods used in Think Locally, Act Locally: The Detection of Small, Medium-Sized, and …☆13Updated 6 years ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆25Updated 3 years ago
- ☆8Updated 8 years ago
- Graph kernels☆56Updated 3 years ago
- Label Propagation based Community Detection algorithm implemented using multiprocessing module in python (Please have a look at my othe…☆9Updated 14 years ago
- For benchmaring community detection algorithms on social networks with meta-data☆17Updated 10 years ago
- LEMON: A local algorithm for fast, high-precision overlapping community detection☆54Updated 7 years ago
- OpenMP-based parallel software for computing the truss decomposition of a graph.☆14Updated 7 years ago
- ☆11Updated 7 years ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆87Updated 6 years ago
- mixed membership stochastic block model☆13Updated 8 years ago
- ☆15Updated 8 years ago
- A framework for evaluating community mining algorithms.☆11Updated 9 years ago
- Algorithms for local community detection in networks☆26Updated 8 years ago
- Tools for the generation, analysis and visualisation of complex networks in hyperbolic space.☆27Updated 6 years ago
- Master's thesis project involving label-constrained reachability (LCR)Updated 4 years ago
- NetworkX Addon to allow graph partitioning with METIS☆78Updated 2 years ago
- Jupyter notebooks for examples in the paper "Higher-order organization of complex networks".☆39Updated 7 years ago
- ☆51Updated 8 years ago
- Python Benchmarking Framework for the Clustering Algorithms Evaluation: networks generation and shuffling; failover execution and resourc…☆19Updated 6 years ago
- Algorithms to list k-cliques in real-world graphs☆26Updated 4 years ago
- Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).☆24Updated 5 years ago
- Implementation of the Multiscale Laplacian Graph Kernel☆18Updated 5 years ago
- Fast consensus clustering in networks☆22Updated 7 months ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 6 years ago
- Algorithms for learning network structure from effective resistances and other random-walk-based similarities.☆30Updated 7 years ago
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆61Updated 3 years ago
- Hypergraph Algorithms Package☆96Updated last year
- (PLEASE USE https://github.com/HanKruiger/tsNET) This is here for historical purpose only.☆10Updated 6 years ago