Sensor Based Intelligent Robots P2
There are several improvements for bipartite network flows [2]. However they require the network to be unbalanced in order to substantially speed up the algorithms, i.e. either |U | |V | or |U | |V |, which is not the case in our context. The complexity of finding an optimal (minimum or maximum weight) matching might be reduced if the cost label is also a metric on the node set of the underlying graph. For example if the nodes of the graph are points in the plane and the cost label is the L1 (manhattan), L2 (Euclidean) or L∞ metric...