Bipartite matching finds the largest set of edges that pair nodes from two disjoint sets without overlap. This project implements the Hopcroft-Karp algorithm, which efficiently finds maximum matchings ...

Abstract: Bipartite graphs are widely used in many real-world applications, where discovering clusters is crucial for understanding their underlying structure. However, most existing clustering ...

Abstract: Realizing fast and accurate object detection and tracking models is one of the research hotspots in the field of computer vision. However, with the continuous growth in demand for detecting ...

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

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 ...

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 ...

Recently, Knuth and Ciucu independently proved the surprising fact, conjectured by Stanley, that one connected component of the tensor product of a path with itself (the so-called "Aztec diamond graph ...

The ability to handle large scale graph data is crucial to an increasing number of applications. Much work has been dedicated to supporting basic graph operations such as subgraph matching, ...