{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T16:39:01Z","timestamp":1740155941136,"version":"3.37.3"},"reference-count":9,"publisher":"World Scientific Pub Co Pte Ltd","issue":"05","funder":[{"name":"CONACyT","award":["238469"],"award-info":[{"award-number":["238469"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2019,10]]},"abstract":"<jats:p> This work introduces an algorithm that generates all combinations of size [Formula: see text] ([Formula: see text]) of the set [Formula: see text] satisfying the strong minimal change property (SMCP) and requires [Formula: see text] memory space. The algorithm was implemented both iteratively and recursively; the iterative version has the advantage of processing the current combination in only one place of the algorithm, and the recursive version has the advantage of performing few operations to generate the next combination. The recursive version is similar to the algorithm of Eades and McKay because both algorithms have two functions that recursively call each other to generate the combinations; however, in the algorithm of Eades and McKay the depth of the recursion is [Formula: see text], while in our algorithm is [Formula: see text]. Performance comparison against three algorithms having the SMCP show that the recursive version of our algorithm performs better than the other algorithms when [Formula: see text] is large. <\/jats:p>","DOI":"10.1142\/s1793830919500605","type":"journal-article","created":{"date-parts":[[2019,9,2]],"date-time":"2019-09-02T03:25:16Z","timestamp":1567394716000},"page":"1950060","source":"Crossref","is-referenced-by-count":1,"title":["A low spatial complexity algorithm to generate combinations with the strong minimal change property"],"prefix":"10.1142","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5029-5340","authenticated-orcid":false,"given":"Jose","family":"Torres-Jimenez","sequence":"first","affiliation":[{"name":"CINVESTAV-Tamaulipas, Km. 5.5 Carretera Cd. Victoria-Soto la Marina, 87130, Cd. Victoria Tamps., M\u00e9xico"}]},{"given":"Idelfonso","family":"Izquierdo-Marquez","sequence":"additional","affiliation":[{"name":"CINVESTAV-Tamaulipas, Km. 5.5 Carretera Cd. Victoria-Soto la Marina, 87130, Cd. Victoria Tamps., M\u00e9xico"}]}],"member":"219","published-online":{"date-parts":[[2019,11,3]]},"reference":[{"key":"S1793830919500605BIB001","doi-asserted-by":"publisher","DOI":"10.1145\/360336.360343"},{"key":"S1793830919500605BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-0208(08)72974-8"},{"key":"S1793830919500605BIB003","doi-asserted-by":"publisher","DOI":"10.1145\/362384.362502"},{"key":"S1793830919500605BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(84)90091-7"},{"key":"S1793830919500605BIB005","doi-asserted-by":"publisher","DOI":"10.1145\/321765.321781"},{"volume-title":"The Art of Computer Programming, Volume 4, Fascicle 3: Generating All Combinations and Partitions","year":"2005","author":"Knuth D. E.","key":"S1793830919500605BIB006"},{"key":"S1793830919500605BIB007","doi-asserted-by":"publisher","DOI":"10.1145\/358589.358612"},{"key":"S1793830919500605BIB008","doi-asserted-by":"publisher","DOI":"10.1145\/355826.355830"},{"key":"S1793830919500605BIB009","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1973.223681"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830919500605","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,4]],"date-time":"2019-11-04T01:15:01Z","timestamp":1572830101000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830919500605"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10]]},"references-count":9,"journal-issue":{"issue":"05","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["10.1142\/S1793830919500605"],"URL":"https:\/\/doi.org\/10.1142\/s1793830919500605","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2019,10]]}}}