Abstract
In this paper we introduce the incremental assignment problem. In this problem, a new pair of vertices and their incident edges are added to a weighted bipartite graph whose maximum-weighted matching is already known, and the maximum-weighted matching of the extended graph is sought. We propose an O ( | V | 2 ) algorithm for the problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have