Alternatives and similar repositories for graph-streaming

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

• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆88Updated 6 years ago
• KnightKingWalk / KnightKing
  A general-purpose, distributed graph random walk engine.
  ☆109Updated 2 years ago
• RapidsAtHKUST / SubgraphContainment
  Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo
  ☆17Updated 6 years ago
• Ashish7129 / Graph_Sampling
  Graph Sampling is a python package containing various approaches which samples the original graph according to different sample sizes.
  ☆163Updated 4 years ago
• iwiwi / pruned-landmark-labeling
  Fast and exact shortest-path distance querying index
  ☆90Updated 11 years ago
• Lab41 / survey-community-detection
  Market Survey: Community Detection
  ☆70Updated 8 years ago
• wangsibovictor / fora
  FORA: Simple and Effective Approximate Single-Source Personalized Pagerank
  ☆31Updated 4 years ago
• sbarakat / graph-partitioning
  This repository contains research into the use of graph partitioning algorithms for assigning people shelters based on their social netwo…
  ☆18Updated 6 years ago
• athomo / kcore
  ☆12Updated 8 years ago
• RapidsAtHKUST / SubgraphMatching
  In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
  ☆159Updated last year
• ehab-abdelhamid / GraMi
  GraMi is a novel framework for frequent subgraph mining in a single large graph, GraMi outperforms existing techniques by 2 orders of ma…
  ☆116Updated last year
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆26Updated 4 years ago
• queryproc / optimizing-subgraph-queries-combining-binary-and-worst-case-optimal-joins
  Code for the paper titled "Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins". VLDB'19
  ☆33Updated 4 months ago
• xgfs / verse
  Reference implementation of the paper VERSE: Versatile Graph Embeddings from Similarity Measures
  ☆131Updated 4 years ago
• networkx / networkx-metis
  NetworkX Addon to allow graph partitioning with METIS
  ☆79Updated 2 years ago
• kfoynt / LocalGraphClustering
  ☆143Updated 4 years ago
• domargan / awesome-dynamic-graphs
  A collection of resources on dynamic/streaming/temporal/evolving graph processing systems, databases, data structures, datasets, and rela…
  ☆140Updated 2 years ago
• zhuang29 / graph_database_benchmark
  ☆14Updated 6 years ago
• lhelwerd / WebGraph
  WebGraph framework with extensions
  ☆23Updated 10 years ago
• benedekrozemberczki / EdMot
  An implementation of "EdMot: An Edge Enhancement Approach for Motif-aware Community Detection" (KDD 2019)
  ☆134Updated 2 years ago
• ameloa / streamorder
  Source code for paper "Prioritized Restreaming Algorithms for Balanced Graph Partitioning".
  ☆14Updated 8 months ago
• wuhao-wu-jiang / Personalized-PageRank
  ☆14Updated 3 years ago
• jinw18 / Readings_MLDB
  Paper list about adopting machine learning techniques into data management tasks.
  ☆37Updated 5 years ago
• RapidsAtHKUST / CommunityDetectionCodes
  Some overlapping community detection algorithms (Until 2016). by Yulin Che (https://github.com/CheYulin) for the PhD qualification exam (…
  ☆210Updated 3 years ago
• ansrlab / edgepart
  Graph edge partitioning algorithms
  ☆46Updated 5 years ago
• ldbc / ldbc_graphalytics
  Generic driver for LDBC Graphalytics implementation
  ☆84Updated 8 months ago
• nogrady / dynamo
  DynaMo: Dynamic Community Detection by Incrementally Maximizing Modularity
  ☆29Updated 3 years ago
• zongshenmu / GraphPartitioners
  Graph Partitioning for Large-scale Graph Datasets
  ☆97Updated 3 years ago
• KaHIP / KaHIP
  KaHIP -- Karlsruhe HIGH Quality Partitioning.
  ☆445Updated 4 months ago
• fabiopetroni / VGP
  A software package for one-pass Vertex-cut balanced Graph Partitioning.
  ☆32Updated 10 years ago