What is the time complexity of finding all maximum matchings in a profile of n (n is large) objects in a bipartite graph?

In matching theory, each object is matched to one agent in a bipartite graph. Objects are usually scarce.

22 February 2024 2,277 2 View