Near-linear time algorithm for computing near-maximum independent set
☆19Mar 19, 2022Updated 4 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. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- vertex cover solver☆31Nov 8, 2019Updated 6 years ago
- Maximum independent sets and vertex covers of large sparse graphs.☆83Apr 15, 2026Updated 3 weeks ago
- Repository for MetaVC -- A Meta Local Search Framework For Minimum Vertex Cover (MinVC)☆10Jan 15, 2022Updated 4 years ago
- Winning Solver of PACE Challenge 2019 Track A☆13Mar 12, 2026Updated last month
- 一个低代码、可定制（颜色、字体、模块）的LaTeX中文模板（自用/持续更新）☆36Feb 13, 2026Updated 2 months ago
- Wordpress hosting with auto-scaling - Free Trial Offer • AdFully Managed hosting for WordPress and WooCommerce businesses that need reliable, auto-scalable performance. Cloudways SafeUpdates now available.
- Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force☆15Mar 31, 2025Updated last year
- The code of APP, Scalable Graph Embedding for Asymmetric Proximity. Zhou, Chang and Liu, Yuqiong and Liu, Xiaofei and Liu, Zhongyi and Ga…☆11Nov 11, 2018Updated 7 years ago
- Short writeups/solvers for interesting CTF challenges.☆16Nov 12, 2022Updated 3 years ago
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Sep 8, 2025Updated 8 months ago
- A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.☆21Sep 30, 2025Updated 7 months ago
- Packed and Compressed Hash Tables☆15Apr 7, 2025Updated last year
- More Hierarchy in Route Planning Using Edge Hierarchies☆15Mar 4, 2020Updated 6 years ago
- GossipMap: distributed parallel community detection algorithm☆22Sep 3, 2015Updated 10 years ago
- Parallel space-efficient minimal perfect hash function on SIMD and GPU☆16Jan 4, 2026Updated 4 months ago
- Virtual machines for every use case on DigitalOcean • AdGet dependable uptime with 99.99% SLA, simple security tools, and predictable monthly pricing with DigitalOcean's virtual machines, called Droplets.
- Dumping CTF related code here☆18May 3, 2017Updated 9 years ago
- Karlsruhe Rapid Ride-Pooling (KaRRi) Dynamic Ride-Pooling Dispatcher.☆13Apr 28, 2026Updated last week
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Aug 19, 2025Updated 8 months ago
- Contains matrix sketching algorithms in python☆16May 16, 2022Updated 3 years ago
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆14Sep 5, 2023Updated 2 years ago
- Parallel Maximum Clique Library☆118Aug 20, 2023Updated 2 years ago
- Management of Benchmark Instances and Instance Attributes☆21Mar 13, 2026Updated last month
- Algorithms to list k-cliques in real-world graphs☆25Mar 4, 2021Updated 5 years ago
- Code and data for popular role oriented network embedding methods☆12Jul 18, 2021Updated 4 years ago
- Wordpress hosting with auto-scaling - Free Trial Offer • AdFully Managed hosting for WordPress and WooCommerce businesses that need reliable, auto-scalable performance. Cloudways SafeUpdates now available.
- A tool for parallel and distributed enumeration of cliques and diameter two kplexes.☆15Dec 24, 2022Updated 3 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆34Apr 7, 2025Updated last year
- This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.☆13Feb 23, 2023Updated 3 years ago
- Maximum clique computation over large sparse graphs☆23Mar 19, 2022Updated 4 years ago
- ☆11Dec 30, 2020Updated 5 years ago
- Toolkit for generating graphs and evaluating graph generators.☆17Oct 4, 2023Updated 2 years ago
- ☆36Updated this week
- Implements the frequent directions algorithm for approximating matrices in streams☆33Aug 3, 2017Updated 8 years ago
- Coarse-to-Fine Curriculum Learning☆20Apr 28, 2020Updated 6 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Word Embedding Revisted: Explicit Matrix Factorization☆33Sep 12, 2017Updated 8 years ago
- ☆11Feb 9, 2022Updated 4 years ago
- Hosting the code and scripts for benchmarking 4 graph databases - Neo4j, AgensGraph, LightGraph, and TigerGraph☆23Jan 2, 2024Updated 2 years ago
- 埃及象形文字聖書體MdC轉寫☆12May 3, 2020Updated 6 years ago
- A graph application benchmark suite☆21Jun 2, 2015Updated 10 years ago
- A simple sparse bitmap implementation in java☆22Jan 28, 2016Updated 10 years ago
- ☆10Nov 27, 2017Updated 8 years ago