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
- Maximum independent sets and vertex covers of large sparse graphs.☆73Updated 2 months ago
- Winning Solver of PACE Challenge 2019 Track A☆13Updated 3 years ago
- Near-linear time algorithm for computing near-maximum independent set☆18Updated 2 years ago
- KaGen: Communication-free Massively Distributed Graph Generators☆35Updated last week
- Steiner tree solver☆29Updated 6 years ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Updated 2 months ago
- ☆25Updated 4 years ago
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆13Updated last year
- KaHIP -- Karlsruhe HIGH Quality Partitioning.☆413Updated this week
- GBBS: Graph Based Benchmark Suite☆202Updated last month
- Management of Benchmark Instances and Instance Attributes☆17Updated 2 months ago
- Shared-Memory and Distributed-Memory Parallel Graph Partitioning☆38Updated this week
- Parallel Balanced Binary Tree Structures☆111Updated last month
- Repository for MetaVC -- A Meta Local Search Framework For Minimum Vertex Cover (MinVC)☆10Updated 3 years ago
- ☆9Updated 6 years ago
- PyTorch implementation of NeuroSAT☆27Updated last year
- Parallel Weighted Random Sampling☆19Updated 4 years ago
- More Hierarchy in Route Planning Using Edge Hierarchies☆15Updated 4 years ago
- ☆15Updated last month
- Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs☆21Updated last year
- Aspen is a Low-Latency Graph Streaming System built using Compressed Purely-Functional Trees☆85Updated 5 years ago
- Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with…☆134Updated this week
- Maximum clique computation over large sparse graphs☆19Updated 2 years ago
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Updated 2 months ago
- ☆16Updated 2 months ago
- An open implementation of the MC family of maximum clique algorithms☆11Updated 8 years ago
- A small but efficient C++ library for computing (customized) tree and hypertree decompositions.☆50Updated last year
- UWrMaxSat is a relatively new MiniSat+-based solver participating in MaxSAT Evaluation 2019, where it ranked second places in both main …☆22Updated 6 months ago
- Open-WBO: state-of-the-art MaxSAT and Pseudo-Boolean solver☆74Updated last year
- Graph edge partitioning algorithms☆45Updated 5 years ago