maximum matching in bipartite graph

Réponses (1)

Abhiram
Abhiram le 18 Fév 2025

0 votes

Hi @kmla,
The maximum matching in a bipartite graph can be calculated using a simple depth-first search-based approach as described in the given MATLAB Answers post.
Note that the function assumes the input to be an adjacency matrix of a regular bipartite graph.

Catégories

En savoir plus sur Graph and Network Algorithms dans Centre d'aide et File Exchange

Tags

Question posée :

le 20 Jan 2020

Réponse apportée :

le 18 Fév 2025

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by