wata-orz / vertex_cover
vertex cover solver
☆30Updated 5 years ago
Alternatives and similar repositories for vertex_cover:
Users that are interested in vertex_cover are comparing it to the libraries listed below
- Near-linear time algorithm for computing near-maximum independent set☆18Updated 3 years ago
- Winning Solver of PACE Challenge 2019 Track A☆12Updated 3 years ago
- Maximum independent sets and vertex covers of large sparse graphs.☆73Updated 4 months ago
- Steiner tree solver☆30Updated 6 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆37Updated last month
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆13Updated last year
- Master's thesis project involving label-constrained reachability (LCR)Updated 4 years ago
- Graph edge partitioning algorithms☆46Updated 5 years ago
- Algorithms to list k-cliques in real-world graphs☆26Updated 4 years ago
- Parallel Weighted Random Sampling☆19Updated 4 years ago
- An open implementation of the MC family of maximum clique algorithms☆11Updated 8 years ago
- Scaling Up Subgraph Query Processing with Efficient Subgraph Matching by Shixuan Sun and Dr. Qiong Luo☆17Updated 6 years ago
- The implementation of the paper "Parallel Personalized PageRank on Dynamic Graphs"☆25Updated 7 years ago
- ☆9Updated 6 years ago
- A Header-Only CDCL SAT Solver for Programming Contest☆67Updated 5 years ago
- Fast and exact shortest-path distance querying index☆90Updated 10 years ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated this week
- ☆17Updated 3 months ago
- More Hierarchy in Route Planning Using Edge Hierarchies☆15Updated 5 years ago
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆24Updated last year
- In-Memory Subgraph Matching: An In-depth Study by Dr. Shixuan Sun and Prof. Qiong Luo☆154Updated last year
- Trillion-edge Scale Graph Edge Partitioning☆27Updated 5 years ago
- ☆35Updated 5 years ago
- ☆25Updated 4 years ago
- Code for the paper titled "Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins". VLDB'19☆32Updated 4 years ago
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆425Updated last week
- Source code and datasets of "An In-Depth Study of Continuous Subgraph Matching", accepted by VLDB'22 - By Xibo Sun, Dr. Shixuan Sun, Prof…☆49Updated 2 years ago
- Webgraph++ code (http://cnets.indiana.edu/groups/nan/webgraph/)☆30Updated 7 months ago
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Updated last month
- OpenMP-based parallel program for counting the number of triangles in a sparse graph☆17Updated 7 years ago