maxdan94 / Density-Friendly
C implementation of algorithms to find the Density-Friendly graph decomposition
☆11Updated 4 years ago
Related projects ⓘ
Alternatives and complementary repositories for Density-Friendly
- OpenMP-based parallel software for computing the truss decomposition of a graph.☆12Updated 6 years ago
- CoreScope: Graph Mining Using k-Core Analysis - Patterns, Anomalies and Algorithms (ICDM'16 & KAIS'18)☆15Updated last week
- 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
- Parallel k-core Decomposition on Multicore Platforms☆10Updated 4 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
- A Parallel Graphlet Decomposition Library for Large Graphs☆87Updated 5 years ago
- Maximum clique computation over large sparse graphs☆17Updated 2 years ago
- Master's thesis project involving label-constrained reachability (LCR)☆0Updated 3 years ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆24Updated 2 years ago
- GossipMap: distributed parallel community detection algorithm☆21Updated 9 years ago
- ☆10Updated 7 years ago
- Exact Single-Source SimRank Computation on Large Graphs☆13Updated 4 years ago
- Python Benchmarking Framework for the Clustering Algorithms Evaluation: networks generation and shuffling; failover execution and resourc…☆19Updated 5 years ago
- Dynamic Community Finding☆26Updated 6 years ago
- A framework for evaluating community mining algorithms.☆10Updated 8 years ago
- A fast implementation of spectral clustering on GPU-CPU Platform☆30Updated 6 years ago
- LEMON: A local algorithm for fast, high-precision overlapping community detection☆54Updated 7 years ago
- NetworkX Addon to allow graph partitioning with METIS☆78Updated last year
- mixed membership stochastic block model☆13Updated 8 years ago
- Near-linear time algorithm for computing near-maximum independent set☆17Updated 2 years ago
- ☆136Updated 3 years ago
- Quickly compute all maximal cliques of a graph☆75Updated 6 years ago
- ☆9Updated 6 years ago
- C++ Hypergraph modelling Library using Boost and OpenMP with some algorithms, including isomorphism using Gecode.☆21Updated 2 years ago
- Algorithms to list k-cliques in real-world graphs☆24Updated 3 years ago
- ☆51Updated 8 years ago
- SNAP repository for Ringo☆14Updated 7 years ago
- For benchmaring community detection algorithms on social networks with meta-data☆16Updated 10 years ago
- Algorithms for learning network structure from effective resistances and other random-walk-based similarities.☆31Updated 6 years ago
- The STINGER in-memory graph store and dynamic graph analysis platform. Millions to billions of vertices and edges at thousands to millio…☆11Updated 8 years ago