Alternatives and similar repositories for graph-benchmarks

Users that are interested in graph-benchmarks are comparing it to the libraries listed below

• python-graphblas / graphblas-algorithms
  Graph algorithms written in GraphBLAS
  ☆80Updated 2 months ago
• hackl / network2tikz
  A converter that takes a network (cnet, igraph, networkx, pathpy, ...) and creates a tikz-network for smooth integration into LaTeX.
  ☆52Updated 3 years ago
• arbenson / ScHoLP-Tutorial
  Tutorial for the ScHoLP.jl library and reproducing results from the accompanying paper.
  ☆43Updated 6 years ago
• networkx / networkx-metis
  NetworkX Addon to allow graph partitioning with METIS
  ☆79Updated 2 years ago
• arangoml / fastgraphml
  Given an input graph (ArangoDB or PyG) it generates graph embeddings using Low-Code framework built on top of PyG.
  ☆68Updated last year
• python-graphblas / python-graphblas
  Python library for GraphBLAS: high-performance sparse linear algebra for scalable graph analytics
  ☆135Updated 2 months ago
• WGUNDERWOOD / motifcluster
  Motif-based weighted spectral clustering in Python, R and Julia
  ☆26Updated last year
• aplbrain / grandiso-networkx
  Performant, pure-Python subgraph isomorphism and monomorphism search (aka "motif search")
  ☆62Updated 10 months ago
• paulmorio / geo2dr
  Geo2DR: A Python and PyTorch library for learning distributed representations of graphs.
  ☆46Updated last year
• inguar / Junet.jl
  Julia package for network research
  ☆37Updated 5 years ago
• PhilChodrow / HypergraphModularity
  Code for generative hypergraph clustering via modularity-like objective functions.
  ☆24Updated 3 years ago
• michaelschaub / PartitionStability
  ☆25Updated 6 years ago
• arbenson / higher-order-organization-julia
  Jupyter notebooks for examples in the paper "Higher-order organization of complex networks".
  ☆40Updated 7 years ago
• ferencberes / online-centrality
  Temporal Walk Based Centrality Metric for Graph Streams
  ☆14Updated 2 years ago
• arbenson / Hyper-Evec-Centrality
  Code accompanying the paper "Three hypergraph eigenvector centralities."
  ☆10Updated 6 years ago
• ferencberes / online-node2vec
  Node Embeddings in Dynamic Graphs
  ☆56Updated 3 years ago
• GiulioRossetti / Eva
  Eva: Community Discovery for Labeled Graphs (networkx implementation)
  ☆14Updated 4 years ago
• GiulioRossetti / RDyn
  RDyn: graph benchmark handling community dynamics
  ☆23Updated last year
• GemsLab / StrucEmbedding-GraphLibrary
  The SEMB library is an easy-to-use tool for getting and evaluating structural node embeddings in graphs.
  ☆18Updated 2 years ago
• uzhdag / pathpy
  An OpenSource python package for the analysis of time series data on networks using higher-order and multi-order graphical models.
  ☆50Updated last year
• kfoynt / LocalGraphClustering
  ☆142Updated 4 years ago
• iaciac / py-draw-simplicial-complex
  Draws a 2D simplicial complex from a list of simplices.
  ☆15Updated 5 years ago
• Murali-group / halp
  Hypergraph Algorithms Package
  ☆98Updated last year
• nogrady / dynamo
  DynaMo: Dynamic Community Detection by Incrementally Maximizing Modularity
  ☆28Updated 3 years ago
• pszufe / SimpleHypergraphs.jl
  A simple hypergraphs package for the Julia programming language
  ☆77Updated this week
• GTmac / FastRP
  Code for the CIKM 2019 Paper "Fast and Accurate Network Embeddings via Very Sparse Random Projection"
  ☆57Updated 5 years ago
• adityat / fastconsensus
  Fast consensus clustering in networks
  ☆22Updated 9 months ago
• bkamins / ABCDGraphGenerator.jl
  Artificial Benchmark for Community Detection (ABCD) - A Fast Random Graph Model with Community Structure
  ☆24Updated last month
• nveldt / HypergraphHomophily
  ☆12Updated 2 years ago
• ntamas / plfit
  Fitting power-law distributions to empirical data, according to the method of Clauset, Shalizi and Newman
  ☆50Updated 5 months ago