Incremental assignment problem
TL;DR: An O(|V|^2) algorithm for the incremental assignment problem, in which 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.
read more
About: This article is published in Information Sciences. The article was published on 20 Mar 2007. and is currently open access. The article focuses on the topics: Assignment problem & Matching (graph theory).
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Group Role Assignment via a Kuhn–Munkres Algorithm-Based Solution
Haibin Zhu,MengChu Zhou,Rob Alkins +2 more
- 01 May 2012
TL;DR: An efficient enough solution based on the K-M algorithm that outperforms significantly the exhaustive search approach is offered.
312
The Dynamic Hungarian Algorithm for the Assignment Problem with Changing Costs
G. Ayorkor Mills-Tettey,Anthony Stentz,M. Bernardine Dias +2 more
- 01 Jan 2007
TL;DR: The dynamic Hungarian algorithm, applicable to optimally solving the assignment problem in situations with changing edge costs or weights, is presented and proofs of the correctness and efficiency of the algorithm are presented.
An Efficient Graph Indexing Method
Xiaoli Wang,Xiaofeng Ding,Anthony K. H. Tung,Shanshan Ying,Hai Jin +4 more
- 01 Apr 2012
TL;DR: This paper proposes SEGOS, an indexing and query processing framework for graph similarity search that is easy to be pipelined to support continuous graph pruning and a novel search strategy based on the index.
Solving the Many to Many assignment problem by improving the Kuhn-Munkres algorithm with backtracking
TL;DR: A solution to the M-M assignment problem by improving the K-M algorithm with backtracking (KMB) is proposed and the proposed KMB algorithm is valid and the worst time complexity is O ( ( ? L a i ) 3 ) .
119
Efficient Role Transfer Based on Kuhn–Munkres Algorithm
Haibin Zhu,MengChu Zhou +1 more
- 01 Mar 2012
TL;DR: The Kuhn-Munkres (or Hungarian) algorithm for the general assignment problems (GAPs) is introduced and a new efficient algorithm to solve the M-M role transfer problems by converting them to the GAPs is proposed.
97
References
The Hungarian method for the assignment problem
TL;DR: This paper has always been one of my favorite children, combining as it does elements of the duality of linear programming and combinatorial tools from graph theory, and it may be of some interest to tell the story of its origin this article.
•Book
Graph theory with applications
J. A. Bondy
- 01 Jan 1976
TL;DR: In this paper, the authors present Graph Theory with Applications: Graph theory with applications, a collection of applications of graph theory in the field of Operational Research and Management. Journal of the Operational research Society: Vol. 28, Volume 28, issue 1, pp. 237-238.
8.8K
Algorithms for the Assignment and Transportation Problems
TL;DR: In this paper, algorithms for the solution of the general assignment and transportation problems are presen, and the algorithm is generalized to one for the transportation problem.