franktakes / teexgraph
C++ library for large-scale network analysis and computation
☆27Updated last year
Alternatives and similar repositories for teexgraph:
Users that are interested in teexgraph are comparing it to the libraries listed below
- A Parallel Graphlet Decomposition Library for Large Graphs☆87Updated 6 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆37Updated last month
- Implements a generalized Louvain algorithm (C++ backend and Matlab interface)☆22Updated 5 years ago
- C++ Hypergraph modelling Library using Boost and OpenMP with some algorithms, including isomorphism using Gecode.☆21Updated 2 years ago
- GraphBLAS Template Library (GBTL): C++ graph algorithms and primitives using semiring algebra as defined at graphblas.org☆133Updated last year
- This the open source graph drawing package KaDraw (Karlsruhe Graph Drawing).☆10Updated last year
- Webgraph++ code (http://cnets.indiana.edu/groups/nan/webgraph/)☆30Updated 8 months ago
- A small but efficient C++ library for computing (customized) tree and hypertree decompositions.☆52Updated last year
- Code accompanying the paper "Three hypergraph eigenvector centralities."☆10Updated 6 years ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆38Updated this week
- MPI+OpenMP implementation of Louvain method for Graph Community Detection, with a number of parallel heuristics/approximate computing tec…☆27Updated last year
- Hypergraph Algorithms Package☆96Updated last year
- More Hierarchy in Route Planning Using Edge Hierarchies☆15Updated 5 years ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆25Updated 2 years ago
- Flow stability framework for dynamic community detection in temporal networks☆24Updated 2 weeks ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆87Updated 5 years ago
- Vienna Graph Clustering☆16Updated 3 months ago
- ☆9Updated 6 years ago
- GBBS: Graph Based Benchmark Suite☆206Updated 4 months ago
- Near-linear time algorithm for computing near-maximum independent set☆18Updated 3 years ago
- A C++ implementation of Walker's Alias Method for quickly sampling from an array with a given probability distribution☆9Updated 9 years ago
- Parallel Frequent Subgraph Mining☆31Updated 7 years ago
- Code for generative hypergraph clustering via modularity-like objective functions.☆22Updated 2 years ago
- A parallel packed CSR data structure for large-scale dynamic graphs☆14Updated 2 years ago
- Parallel Balanced Binary Tree Structures☆115Updated last month
- Temporal networks in Python. Provides fast tools to analyze temporal contact networks and simulate dynamic processes on them using Gilles…☆105Updated 4 years ago
- Hybrid methods for Parallel Betweenness Centrality on the GPU☆24Updated 6 years ago
- Simplifying Experimental Algorithmics☆17Updated 4 months ago
- CPAM: Compressed Parallel Augmented Maps☆23Updated 6 months ago
- A scalable distributed graph partitioner. Ongoing research.☆15Updated 7 years ago