In this project, we worked on solving a very real and critical problem: how to allocate hospital resources efficiently during emergencies. When there's a sudden rise in patients, like during a ...

We present an Oe(m + n 1.5 )-time randomized algorithm for maximum cardinality bipartite matching and related problems (e.g. transshipment, negative-weight shortest paths, and optimal transport) on ...

Abstract: This paper introduces Localized Bipartite Match Graph Attention Q-Learning (BMG-Q), a novel Multi-Agent Reinforcement Learning (MARL) algorithm framework tailored for ride-pooling order ...

Abstract: Computing maximum matchings in bipartite graphs is an important problem with applications in domains such as resource allocation, chemical analysis, and bioinformatics. The leading ...

Matlab code for the Neural Networks 2026 paper "One-step Bipartite Graph Cut: A Normalized Formulation and Its Application to Scalable Subspace Clustering".

The Monthly publishes articles, as well as notes and other features, about mathematics and the profession. Its readers span a broad spectrum of mathematical interests, and include professional ...

On the 27th of September 2024, M.Sc. Juha Harvainen defends his PhD thesis on Advances in Sampling and Counting Bipartite Matchings and Directed Acyclic Graphs. The thesis is related to research done ...

This is a preview. Log in through your library . Abstract This paper investigates the group testing problem in graphs as follows. Given a graph G = (V, E), determine the minimum number t(G) such that ...