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.☆85Apr 15, 2026Updated last month
- An open implementation of the MC family of maximum clique algorithms☆13Aug 4, 2016Updated 9 years ago
- Towards Optimal-Space Minimal Perfect Hashing Beyond Brute-Force☆15Mar 31, 2025Updated last year
- Exact Single-Source SimRank Computation on Large Graphs☆13Oct 1, 2020Updated 5 years ago
- Serverless GPU API endpoints on Runpod - Get Bonus Credits • AdSkip the infrastructure headaches. Auto-scaling, pay-as-you-go, no-ops approach lets you focus on innovating your application.
- 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
- Dynamic Hashed Blocks (DHB) data structure for dynamic graphs☆12Sep 8, 2025Updated 8 months ago
- Library for finding maximum cliques on graphs☆17Jan 11, 2022Updated 4 years ago
- REplicated STORagE☆13Mar 23, 2023Updated 3 years 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
- Mage DPS simulator for WoW Wotlk Classic☆11Feb 27, 2024Updated 2 years ago
- Paper, code, experiments and evaluation for ESA2020 paper "Space-efficient, Fast and Exact Routing in Time-dependent Road Networks"☆12Mar 12, 2021Updated 5 years ago
- Dumping CTF related code here☆18May 3, 2017Updated 9 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.
- Karlsruhe Rapid Ride-Pooling (KaRRi) Dynamic Ride-Pooling Dispatcher.☆13May 21, 2026Updated last week
- Powerful assertions made easy: Define assertion levels, get insights with expression decomposition, and switch between exceptions and ass…☆11Aug 19, 2025Updated 9 months ago
- Parallel Maximum Clique Library☆120Aug 20, 2023Updated 2 years ago
- Code for monograph "Cohesive Subgraph Computation over Large Sparse Graphs"☆25Apr 24, 2022Updated 4 years ago
- ☆15May 11, 2020Updated 6 years ago
- Management of Benchmark Instances and Instance Attributes☆21May 22, 2026Updated last week
- Algorithms to list k-cliques in real-world graphs☆25Mar 4, 2021Updated 5 years ago
- Blog of finesse☆14Jun 21, 2016Updated 9 years ago
- Fast generator for random graphs with prescribed degree sequence☆18May 3, 2024Updated 2 years ago
- AI Agents on DigitalOcean Gradient AI Platform • AdBuild production-ready AI agents using customizable tools or access multiple LLMs through a single endpoint. Create custom knowledge bases or connect external data.
- A tool for parallel and distributed enumeration of cliques and diameter two kplexes.☆15Dec 24, 2022Updated 3 years ago
- ☆22Feb 24, 2020Updated 6 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
- A songbook about IT and computer science☆26Mar 24, 2019Updated 7 years ago
- 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
- ☆17Feb 11, 2026Updated 3 months ago
- Maximum clique computation over large sparse graphs☆23Mar 19, 2022Updated 4 years ago
- Intermediate Compute Language with OpenCL/CUDA Backends☆20Oct 11, 2014Updated 11 years ago
- ☆11Dec 30, 2020Updated 5 years ago
- Deploy on Railway without the complexity - Free Credits Offer • AdConnect your repo and Railway handles the rest with instant previews. Quickly provision container image services, databases, and storage volumes.
- Toolkit for generating graphs and evaluating graph generators.☆17Oct 4, 2023Updated 2 years ago
- 在Apple芯片(M1/2)的Mac上读写NTFS硬盘的开源解决方案☆38May 15, 2023Updated 3 years ago
- fast randomized SVD and its application to SVT algorithm☆26Feb 2, 2023Updated 3 years ago
- ☆15Sep 5, 2016Updated 9 years ago
- C++ Hypergraph modelling Library using Boost and OpenMP with some algorithms, including isomorphism using Gecode.☆25Aug 9, 2022Updated 3 years ago
- ☆11Nov 23, 2023Updated 2 years ago
- An exact algorithm for the maximum clique problem (MCP) which improves over state-of-the-art approaches in some cases by orders of magnit…☆15Nov 15, 2025Updated 6 months ago