Incremental assignment problem

被引：26
|
作者：
Toroslu, Ismail H. [1 ]
Ucoluk, Gokturk [1 ]
机构：
[1] Middle E Tech Univ, Dept Comp Engn, TR-06531 Ankara, Turkey
来源：
INFORMATION SCIENCES | 2007年 / 177卷 / 06期
关键词：
assignment problem; weighted bipartite graph; Hungarian algorithm;
D O I：
10.1016/j.ins.2006.05.004
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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(vertical bar V vertical bar(2)) algorithm for the problem. (c) 2006 Elsevier Inc. All rights reserved.
引用
收藏
页码：1523 / 1529
页数：7
相关论文
共 50 条
12345