-
Transplanting comments by @candu [on the other repo](https://github.com/CityofToronto/bdit_vfh/pull/90) to here.
- [ ] make `digraph_to_bipartite` always return a directed graph; calling methods ca…
cczhu updated
5 years ago
-
-
The program will find the maximum bipartite matching where no selected edge shares a vertex with any other selected edge
-
the algorithm finds maximum bipartite matching in the bipartite graph without using maximum flow algorithm and use naive dfs to do that.
-
**Why this Nup?**
Maximum (weighted) matching. This is a distinctly different model (MIP) from the linear network flow of bipartite matching.
**Does it fall under an existing category?**
Yes,…
-
I have some data which doesn't permit full matching. If I convert it to dense and solve using `scipy.optimize.linear_sum_assignment` I can get a (non-full) solution.
Is it possible to remove this …
-
e.g. networkx implementation of matching algorithms (refs in SI of acquisition paper)...
see e.g. https://en.wikipedia.org/wiki/Matching_(graph_theory)#Online_bipartite_matching
-
I think adding a new graphtheory algorithm is useful. The Hungarian algorithm is a good solution for bipartite graph matching problems
-
We could also treat this as searching a maximal/minimal matching in a complete bipartite graph using this paper:
https://www.sciencedirect.com/science/article/pii/S0304397511010474
-
I was looking at this, because I wanted to convert it to Julia v1.0, but I'm not sure this function actually does what it should do.
From my understanding, it tries to solve the following (simplified…