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:
- CoreScope: Graph Mining Using k-Core Analysis - Patterns, Anomalies and Algorithms (ICDM'16 & KAIS'18)☆16Updated 11 months ago
- A Parallel Graphlet Decomposition Library for Large Graphs☆89Updated 6 years ago
- OpenMP-based parallel software for computing the truss decomposition of a graph.☆14Updated 7 years ago
- Quickly compute all maximal cliques of a graph☆80Updated 6 years ago
- (PLEASE USE https://github.com/HanKruiger/tsNET) This is here for historical purpose only.☆10Updated 6 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
- mixed membership stochastic block model☆13Updated 9 years ago
- ☆144Updated 4 years ago
- LEMON: A local algorithm for fast, high-precision overlapping community detection☆55Updated 8 years ago
- Tools for the generation, analysis and visualisation of complex networks in hyperbolic space.☆27Updated 6 years ago
- Graph kernels☆55Updated 3 years ago
- Hypergraph Algorithms Package☆98Updated 2 years ago
- Maximum clique computation over large sparse graphs☆23Updated 3 years ago
- Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures☆133Updated 4 years ago
- ☆51Updated 8 years ago
- Subgraph matching and isomorphisms in Python.☆28Updated 2 years ago
- Python implementation of Kohler et al.'s random walk with restart☆29Updated 7 years ago
- Graph Feature Representation/Vector Based On The Family Of Graph Spectral Distances (NIPS 2017).☆24Updated 5 years ago
- Maximal Biclique Enumeration in Bipartite Graphs☆21Updated 5 years ago
- OhmNet: Representation learning in multi-layer graphs☆83Updated 5 years ago
- NetworkX Addon to allow graph partitioning with METIS☆79Updated 2 years ago
- An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)☆69Updated 2 years ago
- Python Benchmarking Framework for the Clustering Algorithms Evaluation: networks generation and shuffling; failover execution and resourc…☆19Updated 6 years ago
- Code for paper: Localized matrix factorization for recommendation based on matrix block diagonal forms☆10Updated 10 years ago
- Algorithms for local community detection in networks☆26Updated 8 years ago
- Programs to identify link communities in complex networks☆97Updated 4 years ago
- Python wrapper for the Kavosh network motif finder☆52Updated 10 years ago
- A Persistent Weisfeiler–Lehman Procedure for Graph Classification☆63Updated 4 years ago
- A fast implementation of spectral clustering on GPU-CPU Platform☆32Updated 7 years ago
- Codes for TopPPR☆14Updated 6 years ago