{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T14:06:55Z","timestamp":1766066815303,"version":"3.37.3"},"reference-count":9,"publisher":"World Scientific Pub Co Pte Ltd","issue":"06","funder":[{"DOI":"10.13039\/501100003141","name":"Consejo Nacional de Ciencia y Tecnolog\u00eda","doi-asserted-by":"publisher","award":["238469"],"award-info":[{"award-number":["238469"]}],"id":[{"id":"10.13039\/501100003141","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2017,12]]},"abstract":"<jats:p> A hypergraph [Formula: see text] with vertex set [Formula: see text] and edge set [Formula: see text] differs from a graph in that an edge can connect more than two vertices. An r-uniform hypergraph [Formula: see text] is a hypergraph with hyperedges of size [Formula: see text]. For an r-uniform hypergraph [Formula: see text], an r-uniform clique is a subset [Formula: see text] of [Formula: see text] such as every subset of [Formula: see text] elements of [Formula: see text] belongs to [Formula: see text]. We present hClique, an exact algorithm to find a maximum r-uniform clique for [Formula: see text]-uniform graphs. In order to evidence the performance of hClique, 32 random [Formula: see text]-graphs were solved. <\/jats:p>","DOI":"10.1142\/s1793830917500781","type":"journal-article","created":{"date-parts":[[2017,11,14]],"date-time":"2017-11-14T02:59:45Z","timestamp":1510628385000},"page":"1750078","source":"Crossref","is-referenced-by-count":8,"title":["<i>hClique<\/i>: An exact algorithm for maximum clique problem in uniform hypergraphs"],"prefix":"10.1142","volume":"09","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":"Jose Carlos","family":"Perez-Torres","sequence":"additional","affiliation":[{"name":"CINVESTAV-Tamaulipas, Km. 5.5 Carretera Cd. Victoria-Soto la Marina, 87130, Cd. Victoria Tamps., M\u00e9xico"}]},{"given":"Gildardo","family":"Maldonado-Martinez","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":[[2017,12,13]]},"reference":[{"key":"S1793830917500781BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(90)90057-C"},{"key":"S1793830917500781BIB002","first-page":"237","volume-title":"Graph Theory, Combinatorics and Algorithms","author":"Hartman A.","year":"2004"},{"key":"S1793830917500781BIB003","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"S1793830917500781BIB004","first-page":"569","volume":"58","author":"Konc J.","year":"2007","journal-title":"Commun. Math. Comput. Chem."},{"key":"S1793830917500781BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00290-6"},{"key":"S1793830917500781BIB006","first-page":"742","volume":"27","author":"Pr\u00fcffer H.","year":"1918","journal-title":"Arch. Math. Phys."},{"key":"S1793830917500781BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.07.019"},{"key":"S1793830917500781BIB009","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45066-1_22"},{"key":"S1793830917500781BIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.09.064"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830917500781","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,21]],"date-time":"2019-09-21T20:36:52Z","timestamp":1569098212000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830917500781"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12]]},"references-count":9,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2017,12,13]]},"published-print":{"date-parts":[[2017,12]]}},"alternative-id":["10.1142\/S1793830917500781"],"URL":"https:\/\/doi.org\/10.1142\/s1793830917500781","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2017,12]]}}}