I plan to implement multi particle tracking on a time series of different positions. In order to associate the data, I need to solve the minimum weighted bipartite matching problem with maximum cardinality but not perfect matching (particles may be created or annihilated) ? According to the documentation of iGraph the method "graph_maximum_bipartite_matching" solves for integer weights. A note says that the algorithm is stable only for integer weights. My question is what exactly is meant by stability in this context ? Which algorithm is used to realize the matching ? (Hungarian, Blossom,...)
_______________________________________________ igraph-help mailing list [email protected] https://lists.nongnu.org/mailman/listinfo/igraph-help
