LijunChang / Near-Maximum-Independent-Set

Related projects ⓘ

Alternatives and complementary repositories for Near-Maximum-Independent-Set

• LijunChang / Cohesive_subgraph_book
  Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"
  ☆24Updated 2 years ago
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆35Updated this week
• wata-orz / vertex_cover
  vertex cover solver
  ☆28Updated 5 years ago
• DeLaChance / LCR
  Master's thesis project involving label-constrained reachability (LCR)
  ☆0Updated 3 years ago
• KarlsruheMIS / KaMIS
  Maximum independent sets and vertex covers of large sparse graphs.
  ☆71Updated last week
• syhlalala / PAM-AE
  ☆9Updated 6 years ago
• maxdan94 / kClist
  Algorithms to list k-cliques in real-world graphs
  ☆24Updated 3 years ago
• KarypisLab / TriangleCounting
  OpenMP-based parallel program for counting the number of triangles in a sparse graph
  ☆16Updated 6 years ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆195Updated last week
• Hespian / EdgeHierarchies
  More Hierarchy in Route Planning Using Edge Hierarchies
  ☆15Updated 4 years ago
• ehab-abdelhamid / ScaleMine
  Parallel Frequent Subgraph Mining
  ☆28Updated 7 years ago
• PASSIONLab / terrace
  Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs
  ☆21Updated last year
• kahypar / mt-kahypar
  Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…
  ☆126Updated this week
• ansrlab / edgepart
  Graph edge partitioning algorithms
  ☆45Updated 5 years ago
• cmuparlay / pbbslib
  ☆25Updated 3 years ago
• masatoshihanai / DistributedNE
  Trillion-edge Scale Graph Edge Partitioning
  ☆26Updated 5 years ago
• hu-macsy / dhb
  Dynamic Hashed Blocks (DHB) data structure for dynamic graphs
  ☆12Updated last week
• KaHIP / KaMinPar
  Shared-Memory and Distributed-Memory Parallel Graph Partitioning
  ☆35Updated this week
• RapidsAtHKUST / SubgraphContainment
  Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo
  ☆17Updated 5 years ago
• guowentian / dynamicppr
  The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"
  ☆25Updated 6 years ago
• KaHIP / KaHIP
  KaHIP -- Karlsruhe HIGH Quality Partitioning.
  ☆396Updated 4 months ago
• KarlsruheMIS / pace-2019
  Winning Solver of PACE Challenge 2019 Track A
  ☆13Updated 3 years ago
• fabiopetroni / VGP
  A software package for one-pass Vertex-cut balanced Graph Partitioning.
  ☆29Updated 9 years ago
• wheatman / Packed-Compressed-Sparse-Row
  Dynamic data structure for sparse graphs.
  ☆27Updated 7 months ago
• RapidsAtHKUST / AccTrussDecomposition
  Source code of "Accelerating Truss Decomposition on Heterogeneous Processors", accepted by VLDB'20 - By Yulin Che, Zhuohang Lai, Shixuan …
  ☆14Updated 4 years ago
• iHeartGraph / iBFS
  iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16
  ☆24Updated 7 years ago
• RapidsAtHKUST / SubgraphMatching
  In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo
  ☆147Updated last year
• athomo / kcore
  ☆10Updated 7 years ago
• ldhulipala / aspen
  Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees
  ☆85Updated 5 years ago
• KnightKingWalk / KnightKing
  A general-purpose, distributed graph random walk engine.
  ☆110Updated last year