Alternatives and similar repositories for K-Truss

Users that are interested in K-Truss are comparing it to the libraries listed below

• networkx / networkx-metis
  NetworkX Addon to allow graph partitioning with METIS
  ☆79Updated 2 years ago
• KarypisLab / TriangleCounting
  OpenMP-based parallel program for counting the number of triangles in a sparse graph
  ☆18Updated last month
• maxdan94 / Density-Friendly
  C implementation of algorithms to find the Density-Friendly graph decomposition
  ☆11Updated 5 years ago
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆26Updated 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
• eXascaleInfolab / PyCABeM
  Python Benchmarking Framework for the Clustering Algorithms Evaluation: networks generation and shuffling; failover execution and resourc…
  ☆19Updated 6 years ago
• nkahmed / PGD
  A Parallel Graphlet Decomposition Library for Large Graphs
  ☆88Updated 6 years ago
• LijunChang / Cohesive_subgraph_book
  Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
  ☆26Updated 3 years ago
• YixuanLi / LEMON
  LEMON: A local algorithm for fast, high-precision overlapping community detection
  ☆55Updated 7 years ago
• spcl / gms
  GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning
  ☆26Updated 4 years ago
• graphchallenge / GraphChallenge
  Graph Challenge
  ☆31Updated 6 years ago
• inducer / pymetis
  A Python wrapper around Metis, a graph partitioning package
  ☆186Updated last week
• Adam27X / hybrid_BC
  Hybrid methods for Parallel Betweenness Centrality on the GPU
  ☆24Updated 6 years ago
• ParAlg / CPAM
  CPAM: Compressed Parallel Augmented Maps
  ☆24Updated 2 weeks ago
• beginner1010 / butterfly-counting
  The source code for BUTTERFLY COUNTING IN BIPARTITE NETWORKS
  ☆12Updated 6 years ago
• KnightKingWalk / KnightKing
  A general-purpose, distributed graph random walk engine.
  ☆109Updated 2 years ago
• LuxGraph / Lux
  A Distributed Multi-GPU System for Fast Graph Processing
  ☆65Updated 6 years ago
• michaelschaub / generalizedLouvain
  Implements a generalized Louvain algorithm (C++ backend and Matlab interface)
  ☆22Updated 5 years ago
• guowentian / dynamicppr
  The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"
  ☆25Updated 7 years ago
• narayanan2004 / GraphMat
  GraphMat graph analytics framework
  ☆102Updated 2 years ago
• wanghzccls / ExactSim
  Exact Single-Source SimRank Computation on Large Graphs
  ☆13Updated 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
• pnnl / ripples
  A C++ Library for Influence Maximization
  ☆34Updated 8 months ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆212Updated 3 weeks ago
• Xtra-Computing / G3
  G3: A Programmable GNN Training System on GPU
  ☆43Updated 5 years ago
• RapidsAtHKUST / SubgraphContainment
  Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo
  ☆17Updated 6 years ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆87Updated 6 years ago
• realstolz / powerlyra
  Differentiated Computation and Partitioning on Skewed (Natural or Bipartite) Graphs
  ☆66Updated 3 years ago
• kfoynt / LocalGraphClustering
  ☆143Updated 4 years ago
• jacobratkiewicz / webgraph
  Webgraph++ code (http://cnets.indiana.edu/groups/nan/webgraph/)
  ☆32Updated last year