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:
- GBBS: Graph Based Benchmark Suite☆212Updated last month
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆449Updated 4 months ago
- Algorithms to list k-cliques in real-world graphs☆26Updated 4 years ago
- ☆25Updated 4 years ago
- iBFS: Concurrent Breadth-First Search on GPUs. SIGMOD'16☆25Updated 8 years ago
- Trillion-edge Scale Graph Edge Partitioning☆29Updated 5 years ago
- Graph edge partitioning algorithms☆47Updated 5 years ago
- ☆24Updated 9 months ago
- ☆37Updated 6 years ago
- ☆24Updated 2 years ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆26Updated 3 years ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆27Updated 2 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 6 years ago
- Experimental Setup for Performance Analysis of Streaming Algorithms☆31Updated 3 years ago
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆87Updated 6 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
- Parallel Balanced Binary Tree Structures☆118Updated 6 months ago
- Source code of "RapidFlow: An Efficient Approach to Continuous Subgraph Matching" published in VLDB'2022 - By Shixuan Sun, Xibo Sun, Bing…☆32Updated 3 years ago
- Exact Single-Source SimRank Computation on Large Graphs☆13Updated 4 years ago
- ☆21Updated 4 years ago
- Graph Partitioning for Large-scale Graph Datasets☆97Updated 3 years ago
- Parallel Weighted Random Sampling☆19Updated 4 years ago
- A software package for one-pass Vertex-cut balanced Graph Partitioning.☆32Updated 10 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆42Updated last month
- Asynchronous Multi-GPU Programming Framework☆47Updated 4 years ago
- Differentiated Computation and Partitioning on Skewed (Natural or Bipartite) Graphs☆66Updated 3 years ago
- Source code and datasets of "An In-Depth Study of Continuous Subgraph Matching", accepted by VLDB'22 - By Xibo Sun, Dr. Shixuan Sun, Prof…☆50Updated 2 years ago
- Code for the paper titled "Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins". VLDB'19☆33Updated 4 months ago
- Dynamic data structure for sparse graphs.☆31Updated last year