A lightweight and efficient implementation of the Munkres (Hungarian) algorithm for optimal assignment.
-
Updated
Oct 14, 2024 - TypeScript
#
munkres-algorithm
Here are 5 public repositories matching this topic...
This repository is a collection of Python scripts and Jupyter notebooks for understanding the performance improvement in image classification, object detection and instance segmentation with OpenVINO. It also contains reference implementations of dwell time analytics, ALPR and polyp detection.
computer-vision image-classification object-detection reference-implementation object-tracking person-reidentification edge-computing model-deployment video-analytics edge-ai polyp-detection dwell-time-algorithm openvino-toolkit model-optimization dlstreamer vehicle-license-plate-recognition yolov8-segmentation munkres-algorithm yolov8-detection yolov11
-
Updated
Mar 15, 2025 - Jupyter Notebook
A small project on the Linear Assignment Problem (LAP)
-
Updated
Mar 8, 2025 - Python
The Hungarian algorithm solves the assignment problem in polynomial time. Also known as: Munkres algorithm.
-
Updated
Aug 16, 2023 - JavaScript
The ESN Buddy Matcher is a Python tool that pairs local and incoming students based on interests and availability. It utilizes data processing and the Kuhn-Munkres algorithm to create an optimal matching matrix for better student integration.
-
Updated
Feb 21, 2025 - Python
Improve this page
Add a description, image, and links to the munkres-algorithm topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the munkres-algorithm topic, visit your repo's landing page and select "manage topics."