id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
cana-307	N. Logapriya,, et al.	Three Persons Satisfactory Roommates Problem with Incomplete List	2024	9	.pdf	application/pdf	3277	196	68	The problem of finding large weakly stable matchings in the presence of incomplete preference lists containing onesided ties was examined by Lam and Plaxton Two variations of the traditional Stable Roommates (SR) problem with incomplete (but strictly ordered) preference lists (SRI) that are degree-constrained—that is, preference lists with restricted length—were examined by Cseh et al.	cache/cana-307.pdf	txt/cana-307.txt
