🍰 Partitioning algorithms for JavaScript
-
Updated
Jun 12, 2024 - JavaScript
🍰 Partitioning algorithms for JavaScript
Header-Only C++ Library for Graph Representation and Algorithms
Mt-KaHyPar (Multi-Threaded Karlsruhe Hypergraph Partitioner) is a shared-memory multilevel graph and hypergraph partitioner equipped with parallel implementations of techniques used in the best sequential partitioning algorithms. Mt-KaHyPar can partition extremely large hypergraphs very fast and with high quality.
implementation of partitioning mechanism on Apache Kafka and asynchronous communication between Vert.x microservices
Big Data Modeling, MapReduce, Spark, PySpark @ Santa Clara University
KaHyPar (Karlsruhe Hypergraph Partitioning) is a multilevel hypergraph partitioning framework providing direct k-way and recursive bisection based partitioning algorithms that compute solutions of very high quality.
Generic graph (analysis) library in Typescript
Partitions an interval as evenly as possible.
KaHIP -- Karlsruhe HIGH Quality Partitioning.
METIS - Serial Graph Partitioning and Fill-reducing Matrix Ordering
A Python library for anti-clustering algorithms
O'Reilly Book: [Data Algorithms with Spark] by Mahmoud Parsian
Coursework of NTHU CS516000 FPGA Architecture & CAD
Coursework of NTHU CS613500 VLSI Physical Design Automation
Complex ray tracing algorithm optimized by using parallelization over different partitioning schemes and explore the performance gains through grain size and processing units (parameters) over sequential algorithm to render a high resolution image.
This repository contains a variety of algorithms designed for graph clustering problems.
Implementation of the subtask partitioning algorithm described by the HydraNets paper (Mullapudi, et al)
Add a description, image, and links to the partitioning-algorithms topic page so that developers can more easily learn about it.
To associate your repository with the partitioning-algorithms topic, visit your repo's landing page and select "manage topics."