An open implementation of the MC family of maximum clique algorithms
☆13Aug 4, 2016Updated 9 years ago
Alternatives and similar repositories for open-mcs
Users that are interested in open-mcs are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Near-linear time algorithm for computing near-maximum independent set☆19Mar 19, 2022Updated 4 years ago
- A tool for parallel and distributed enumeration of cliques and diameter two kplexes.☆15Dec 24, 2022Updated 3 years ago
- Library for finding maximum cliques on graphs☆17Jan 11, 2022Updated 4 years ago
- Parallel Maximum Clique Library☆120Aug 20, 2023Updated 2 years ago
- Quickly compute all maximal cliques of a graph☆80Oct 23, 2018Updated 7 years 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.
- A GWT JsInterop wrapper for Leaflet.☆33Aug 8, 2025Updated 9 months ago
- Toolkit for generating graphs and evaluating graph generators.☆17Oct 4, 2023Updated 2 years ago
- C++ Hypergraph modelling Library using Boost and OpenMP with some algorithms, including isomorphism using Gecode.☆25Aug 9, 2022Updated 3 years ago
- GossipMap: distributed parallel community detection algorithm☆22Sep 3, 2015Updated 10 years ago
- performance counters in C++☆28Apr 24, 2026Updated last month
- A graph application benchmark suite☆21Jun 2, 2015Updated 10 years ago
- ☆15Mar 12, 2024Updated 2 years ago
- OEBench: Investigating Open Environment Challenges in Real-World Relational Data Streams (VLDB 2024)☆13Aug 27, 2024Updated last year
- 1) SimRank (single pair query, parallel all pair computation / dynamic updates) - by Yue Wang (https://github.com/KeithYue) and Yulin Che…☆14Aug 29, 2020Updated 5 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.
- ☆16Jan 24, 2025Updated last year
- Instances for the Pickup and Delivery Problem with Time Windows (PDPTW) based on open data☆59Jul 12, 2025Updated 10 months ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Sep 13, 2018Updated 7 years ago
- Source code of "PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration", published in SIGMOD'2021 - By Shixuan Sun, Yuhang Chen…☆17Mar 23, 2021Updated 5 years ago
- Packed Memory Array☆17May 14, 2014Updated 12 years ago
- ☆60Dec 2, 2022Updated 3 years ago
- Efficient and Online Dataset Growth Algorithm (with cleanness and diversity awareness) to deal with growing web data☆20Aug 6, 2024Updated last year
- Feature partitioner by imbalance or correlation (ICLR 2024)☆17Mar 25, 2026Updated 2 months ago
- Towards Addressing Label Skews in One-Shot Federated Learning (ICLR 2023)☆17Nov 2, 2023Updated 2 years ago
- Simple, predictable pricing with DigitalOcean hosting • AdAlways know what you'll pay with monthly caps and flat pricing. Enterprise-grade infrastructure trusted by 600k+ customers.
- Data sets and ML models versioning example from DVC get started☆10Jun 4, 2024Updated last year
- Source code of "Accelerating Truss Decomposition on Heterogeneous Processors", accepted by VLDB'20 - By Yulin Che, Zhuohang Lai, Shixuan …☆16May 25, 2020Updated 6 years ago
- Arya: Arbitrary Graph Pattern Mining with Decomposition-based Sampling☆18Sep 27, 2023Updated 2 years ago
- Function Message Interface (FMI): library for message-passing and collective communication for serverless functions.☆22Apr 16, 2024Updated 2 years ago
- OpenMP-based parallel software for computing the truss decomposition of a graph.☆14Mar 28, 2018Updated 8 years ago
- Wide World of Actors, or, Can I Have an Erlang Pony?☆12Mar 19, 2018Updated 8 years ago
- GraphMineSuite (GMS): a benchmarking suite for graph mining algorithms such as graph pattern matching or graph learning☆26Jun 11, 2021Updated 4 years ago
- Dynamic connectivity data structure by Holm, de Lichtenberg, and Thorup☆23Sep 14, 2023Updated 2 years ago
- Hosting the code and scripts for benchmarking 4 graph databases - Neo4j, AgensGraph, LightGraph, and TigerGraph☆23Jan 2, 2024Updated 2 years ago
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- The SEMB library is an easy-to-use tool for getting and evaluating structural node embeddings in graphs.☆18Mar 24, 2023Updated 3 years ago
- Maximum clique computation over large sparse graphs☆23Mar 19, 2022Updated 4 years ago
- HERE Tracking Library for C☆12May 16, 2019Updated 7 years ago
- introduction to dataflow analysis using julia☆14Oct 26, 2020Updated 5 years ago
- Hybrid methods for Parallel Betweenness Centrality on the GPU☆24Dec 20, 2018Updated 7 years ago
- a size profiler for cuda binary☆70Jan 15, 2026Updated 4 months ago
- A coupled vertical federated learning framework that boosts the model performance with record similarities (NeurIPS 2022)☆28Mar 28, 2023Updated 3 years ago