timlrx / graph-benchmarks
☆79Updated last year
Related projects ⓘ
Alternatives and complementary repositories for graph-benchmarks
- Graph algorithms written in GraphBLAS☆76Updated last month
- Eva: Community Discovery for Labeled Graphs (networkx implementation)☆14Updated 3 years ago
- ☆12Updated 2 years ago
- Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.☆40Updated 5 years ago
- Artificial Benchmark for Community Detection (ABCD) - A Fast Random Graph Model with Community Structure☆22Updated last month
- Automatic feature extraction and node role assignment for transfer learning on graphs (ReFeX & RolX)☆81Updated 4 months ago
- Dynamic programming algorithms for exact linear clustering in networks.☆16Updated last year
- Node Embeddings in Dynamic Graphs☆54Updated 2 years ago
- Performant, pure-Python subgraph isomorphism and monomorphism search (aka "motif search")☆56Updated 3 months ago
- A converter that takes a network (cnet, igraph, networkx, pathpy, ...) and creates a tikz-network for smooth integration into LaTeX.☆52Updated 3 years ago
- Jupyter notebooks for examples in the paper "Higher-order organization of complex networks".☆39Updated 7 years ago
- A tiny library for large graphs☆111Updated last month
- This code implements the decycling and dismantling procedures devoloped in Braunstein, Alfredo, Luca Dall'Asta, Guilhem Semerjian, and L…☆16Updated 8 years ago
- Python library for GraphBLAS: high-performance sparse linear algebra for scalable graph analytics☆126Updated 3 weeks ago
- An OpenSource python package for the analysis of time series data on networks using higher-order and multi-order graphical models.☆85Updated last year
- An OpenSource python package for the analysis of time series data on networks using higher-order and multi-order graphical models.☆49Updated 11 months ago
- SuNBEaM, (s)pectral (n)on-(b)acktracking (e)igenvalue pseudo-(m)etric, a topological graph distance☆15Updated 4 years ago
- Python binding for Reticula: the general purpose library for analysing static, temporal and hypergraph networks.☆18Updated this week
- Given an input graph (ArangoDB or PyG) it generates graph embeddings using Low-Code framework built on top of PyG.☆68Updated 5 months ago
- RDyn: graph benchmark handling community dynamics☆23Updated 6 months ago
- Temporal Walk Based Centrality Metric for Graph Streams☆14Updated last year
- ☆25Updated 6 years ago
- NetworkX Addon to allow graph partitioning with METIS☆78Updated last year
- A Parallel Graphlet Decomposition Library for Large Graphs☆87Updated 5 years ago
- Software for "Configuration Models of Random Hypergraphs"☆27Updated 2 years ago
- Source code for EvalNE, a Python library for evaluating Network Embedding methods.☆106Updated 7 months ago
- (Personalized) Page-Rank computation using PyTorch☆87Updated last year
- An alternative implementation of Recursive Feature and Role Extraction (KDD11 & KDD12)☆67Updated 2 years ago
- Data and source code for the paper "How choosing random-walk model and network representation matters for flow-based community detection …☆11Updated 3 years ago
- Implements a generalized Louvain algorithm (C++ backend and Matlab interface)☆21Updated 5 years ago