Alternatives and similar repositories for historical-pruned-landmark-labeling:

Users that are interested in historical-pruned-landmark-labeling are comparing it to the libraries listed below

• fabiopetroni / VGP
  A software package for one-pass Vertex-cut balanced Graph Partitioning.
  ☆29Updated 9 years ago
• iwiwi / pruned-landmark-labeling
  Fast and exact shortest-path distance querying index
  ☆88Updated 10 years ago
• KnightKingWalk / KnightKing
  A general-purpose, distributed graph random walk engine.
  ☆111Updated last year
• Xtra-Computing / ThunderRW
  Source code of "ThunderRW: An In-Memory Graph Random Walk Engine" published in VLDB'2021 - By Shixuan Sun, Yuhang Chen, Shengliang Lu, Bi…
  ☆26Updated 3 years ago
• anilpacaci / streaming-graph-partitioning
  Experimental Setup for Performance Analysis of Streaming Algorithms
  ☆31Updated 3 years ago
• DeLaChance / LCR
  Master's thesis project involving label-constrained reachability (LCR)
  ☆0Updated 3 years ago
• TsinghuaDatabaseGroup / Dima
  simialrity join or search on spark core directly
  ☆27Updated 4 years ago
• mayerrn / hybrid_edge_partitioner
  ☆18Updated 3 years ago
• Xtra-Computing / ForkGraph
  ☆16Updated 3 years ago
• dsg-uwaterloo / s-graffito
  ☆11Updated 2 months ago
• realstolz / powerlyra
  Differentiated Computation and Partitioning on Skewed (Natural or Bipartite) Graphs
  ☆65Updated 2 years ago
• Gawssin / kCliqueListing
  a k-cliques algorithm
  ☆17Updated 3 years ago
• guowentian / dynamicppr
  The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"
  ☆25Updated 6 years ago
• Smerity / FlashGraph
  A SSD-based graph processing engine for billion-node graphs
  ☆11Updated 9 years ago
• wangsibovictor / fora
  FORA: Simple and Effective Approximate Single-Source Personalized Pagerank
  ☆31Updated 4 years ago
• thu-pacman / GridGraph
  Out-of-core graph processing on a single machine.
  ☆128Updated 6 years ago
• xiangyuzhi / GraphStorageExp
  ☆10Updated 7 months 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
  ☆32Updated 3 years ago
• ansrlab / edgepart
  Graph edge partitioning algorithms
  ☆45Updated 5 years ago
• yspark-dblab / gcare
  ☆26Updated 2 years ago
• datourat / Gorder
  ☆36Updated 5 years ago
• cmuparlay / pbbslib
  ☆25Updated 4 years ago
• masatoshihanai / DistributedNE
  Trillion-edge Scale Graph Edge Partitioning
  ☆26Updated 5 years ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆85Updated 5 years ago
• iDC-NEU / Graph-Computing-Papers
  ☆9Updated 11 months ago
• Team309 / awesome-graph-processing
  A collection of awesome papers about graph processing.
  ☆15Updated 5 years ago
• thu-pacman / GraphPi
  ☆38Updated 3 years ago
• pabmont / pma
  Packed Memory Array
  ☆17Updated 10 years ago
• TsinghuaDatabaseGroup / GTree
  shortest path query and kNN search on road network
  ☆38Updated 7 years ago
• schencoding / GraphLite
  A lightweight graph computation platform in C/C++
  ☆97Updated 5 years ago