Efficient algorithms for finding maximum matching in graphs
ACM Computing Surveys (CSUR)
Efficient implementation of graph algorithms using contraction
Journal of the ACM (JACM)
Optimization
New scaling algorithms for the assignment and minimum mean cycle problems
Mathematical Programming: Series A and B
Handbook of combinatorics (vol. 1)
Task assignment and transaction clustering heuristics for distributed systems
Information Sciences: an International Journal - Special issue: load balancing in distributed systems
An optimal algorithm for solving the searchlight guarding problem on weighted interval graphs
Information Sciences: an International Journal
A note on the weighted matching with penalty problem
Pattern Recognition Letters
Data structures for weighted matching and nearest common ancestors with linking
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
Journal of the ACM (JACM)
A Decomposition Theorem for Maximum Weight Bipartite Matchings
SIAM Journal on Computing
Computing Minimum-Weight Perfect Matchings
INFORMS Journal on Computing
Selected topics on assignment problems
Discrete Applied Mathematics
Personnel assignment problem with hierarchical ordering constraints
Computers and Industrial Engineering
Graph Theory With Applications
Graph Theory With Applications
An O (N2.5) algorithm for maximum matching in general graphs
SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Information Sciences: an International Journal
Capacity constrained assignment in spatial databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Authors' response to "an addendum on the incremental assignment problem" by Volgenant
Information Sciences: an International Journal
Note: An addendum on the incremental assignment problem
Information Sciences: an International Journal
Optimal matching between spatial datasets under capacity constraints
ACM Transactions on Database Systems (TODS)
Toward a General Framework for Polyphonic Comparison
Fundamenta Informaticae - Special Issue on Stringology
Assessing optimal assignment under uncertainty: An interval-based algorithm
International Journal of Robotics Research
Polyphonic alignment algorithms for symbolic music retrieval
CMMR/ICAD'09 Proceedings of the 6th international conference on Auditory Display
Toward a General Framework for Polyphonic Comparison
Fundamenta Informaticae - Special Issue on Stringology
Web hosting with statistical capacity guarantee
Information Sciences: an International Journal
International Journal of Robotics Research
An informatics-based approach to object tracking for distributed live video computing
Multimedia Tools and Applications
| Hi-index | 0.07 |
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.