AN EFFICIENT DEPTH-FIRST SEARCH ALGORITHM FOR SOLVING THE MAXIMUM STABLE MARRIAGE PROBLEM WITH TIES AND INCOMPLETE LISTS
This paper proposes an efficient depth-first search algorithm to solve the maximum stable marriage problem with ties and incomplete preference lists. The key idea of the algorithm is to initialize an empty matching and mark all men as unmatched. In each iteration, an unmatched man proposes to th...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Trường Đại học Vinh
2024-12-01
|
| Series: | Tạp chí Khoa học |
| Subjects: | |
| Online Access: | https://vujs.vn//api/view.aspx?cid=fd776f0d-0fc0-41a1-b599-0de52c8267d6 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|