Author:
Cseh Ágnes,Huang Chien-Chung,Kavitha Telikepalli
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Abraham, D.J., Irving, R.W., Kavitha, T., Mehlhorn, K.: Popular matchings. SIAM Journal on Computing 37(4), 1030–1045 (2007)
2. Berman, P., Karpinski, M., Scott, A.D.: Approximation hardness of short symmetric instances of MAX-3SAT. Electronic Colloquium on Computational Complexity Report, number 49 (2003)
3. Lecture Notes in Computer Science;P Biró,2010
4. Dulmage, A., Mendelsohn, N.: Coverings of bipartite graphs. Canadian Journal of Mathematics 10, 517–534 (1958)
5. Gärdenfors, P.: Match making: assignments based on bilateral preferences. Behavioural Science 20, 166–173 (1975)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献