LijunChang / Near-Maximum-Independent-SetLinks
Near-linear time algorithm for computing near-maximum independent set
☆19Updated 3 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
Sorting:
- The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"☆25Updated 7 years ago
- Trillion-edge Scale Graph Edge Partitioning☆27Updated 5 years ago
- GBBS: Graph Based Benchmark Suite☆211Updated last week
- ☆23Updated 8 months ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 6 years ago
- Algorithms to list k-cliques in real-world graphs☆26Updated 4 years ago
- ☆25Updated 4 years ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆443Updated 3 months ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆26Updated 3 years ago
- A software package for one-pass Vertex-cut balanced Graph Partitioning.☆32Updated 10 years ago
- ☆9Updated 6 years ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆28Updated 2 years ago
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆159Updated last year
- A general-purpose, distributed graph random walk engine.☆109Updated 2 years ago
- Experimental Setup for Performance Analysis of Streaming Algorithms☆31Updated 3 years ago
- Source code for the paper: Accelerating Dynamic Graph Analytics on GPUs☆27Updated 2 years ago
- Graph edge partitioning algorithms☆46Updated 5 years ago
- iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16☆24Updated 8 years ago
- Asynchronous Multi-GPU Programming Framework☆46Updated 4 years ago
- ☆37Updated 5 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆88Updated 6 years ago
- G3: A Programmable GNN Training System on GPU☆43Updated 4 years ago
- ☆18Updated 3 years ago
- Dynamic data structure for sparse graphs.☆31Updated last year
- Master's thesis project involving label-constrained reachability (LCR)☆1Updated 4 years ago
- Graph Partitioning for Large-scale Graph Datasets☆96Updated 3 years ago
- Source code of "Accelerating Truss Decomposition on Heterogeneous Processors", accepted by VLDB'20 - By Yulin Che, Zhuohang Lai, Shixuan …☆16Updated 5 years ago
- Enterprise: Breadth-First Graph Traversal on GPUs. SC'15.☆31Updated 8 years ago
- Maximum clique computation over large sparse graphs☆23Updated 3 years ago
- Frog is Asynchronous Graph Processing on GPU with Hybrid Coloring Model. The fundamental idea is based on Pareto principle (or 80-20 rule…☆36Updated 4 years ago