Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference18 articles.
1. Abraham DJ, Cechlárová K, Manlove DF, Mehlhorn K (2004) Pareto-optimality in house allocation problems. In: Proceedings of 15th ISAAC, pp 3–15
2. Abraham DJ, Irving RW, Kavitha T, Mehlhorn K (2007) Popular matchings. SIAM J Comput 37(4):1030–1045
3. Abraham DJ, Kavitha T (2006) Dynamic matching markets and voting paths. In: Proceedings of 10th Scandinavian workshop on algorithm theory, SWAT 2006, Riga, Latvia, 6–8 July 2006, pp 65–76
4. Baswana S, Gupta M, Sen S (2015) Fully dynamic maximal matching in
$$o(log n)$$
o
(
l
o
g
n
)
update time. SIAM J Comput 44(1):88–113
5. Bhattacharya S, Henzinger M, Italiano GF (2015) Deterministic fully dynamic data structures for vertex cover and matching. In: Proceedings of the twenty-sixth annual ACM-SIAM symposium on discrete algorithms (SODA 2015), pp 785–804
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献