LijunChang / Near-Maximum-Independent-Set
Near-linear time algorithm for computing near-maximum independent set
☆18Updated 2 years ago
Alternatives and similar repositories for Near-Maximum-Independent-Set:
Users that are interested in Near-Maximum-Independent-Set are comparing it to the libraries listed below
- KaGen: Communication-free Massively Distributed Graph Generators☆37Updated 2 weeks ago
- Master's thesis project involving label-constrained reachability (LCR)Updated 3 years ago
- ☆25Updated 4 years ago
- More Hierarchy in Route Planning Using Edge Hierarchies☆15Updated 4 years ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆24Updated last year
- Maximum independent sets and vertex covers of large sparse graphs.☆73Updated 3 months ago
- GBBS: Graph Based Benchmark Suite☆201Updated 2 months ago
- ☆15Updated 2 months ago
- Algorithms to list k-cliques in real-world graphs☆25Updated 3 years ago
- The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"☆25Updated 6 years ago
- Graph edge partitioning algorithms☆45Updated 5 years ago
- Exact Single-Source SimRank Computation on Large Graphs☆13Updated 4 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 6 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆87Updated 5 years ago
- Trillion-edge Scale Graph Edge Partitioning☆27Updated 5 years ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆24Updated 2 years ago
- ☆9Updated 6 years ago
- Parallel Weighted Random Sampling☆19Updated 4 years ago
- A parallel packed CSR data structure for large-scale dynamic graphs☆14Updated 2 years ago
- Dynamic data structure for sparse graphs.☆29Updated 10 months ago
- OpenMP-based parallel program for counting the number of triangles in a sparse graph☆17Updated 6 years ago
- vertex cover solver☆30Updated 5 years ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆39Updated this week
- Code for the paper titled "Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins". VLDB'19☆32Updated 3 years ago
- CuSha is a CUDA-based vertex-centric graph processing framework that uses G-Shards and CW representations.☆52Updated 9 years ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 3 months ago
- CPAM: Compressed Parallel Augmented Maps☆23Updated 4 months ago
- An open implementation of the MC family of maximum clique algorithms☆11Updated 8 years ago
- A software package for one-pass Vertex-cut balanced Graph Partitioning.☆29Updated 9 years ago
- Webgraph++ code (http://cnets.indiana.edu/groups/nan/webgraph/)☆30Updated 6 months ago