{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T07:30:07Z","timestamp":1775719807897,"version":"3.50.1"},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,8,1]],"date-time":"2001-08-01T00:00:00Z","timestamp":996624000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4380,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2001,8]]},"DOI":"10.1016\/s1571-0661(04)80985-x","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T16:47:47Z","timestamp":1096476467000},"page":"177-187","source":"Crossref","is-referenced-by-count":8,"special_numbering":"C","title":["An Efficient Algorithm for Helly Property Recognition in a Linear Hypergraph"],"prefix":"10.1016","volume":"46","author":[{"given":"A.","family":"Bretto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Cherifi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Ub\u00e9da","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80985-X_NEWBIB1","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF02523189","article-title":"Finding and counting given length cycles","volume":"17","author":"Alon","year":"1997","journal-title":"Algorithmica"},{"key":"10.1016\/S1571-0661(04)80985-X_NEWBIB2","series-title":"Graphs","author":"Berge","year":"1985"},{"key":"10.1016\/S1571-0661(04)80985-X_NEWBIB3","series-title":"Hypergraphs","author":"Berge","year":"1989"},{"key":"10.1016\/S1571-0661(04)80985-X_NEWBIB4","first-page":"16","article-title":"The Helly property","volume":"1","author":"Berge","year":"1977","journal-title":"Southeast Asian Bulletin of Mathematics"},{"key":"10.1016\/S1571-0661(04)80985-X_NEWBIB5","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1142\/S0218001495000365","article-title":"A surface feature attributed hypergraph representation for 3-D object recognition","volume":"9","author":"Bhandarkar","year":"1995","journal-title":"Int. Journal of Pattern Recognition and Artificial Intelligence"},{"key":"10.1016\/S1571-0661(04)80985-X_NEWBIB6","series-title":"Discrete Geometry for Computer Imagery: 6th International Workshop (DGCI '96, Lyon)","first-page":"217","article-title":"Hypergraph model of digital topology for grey level images","author":"Bretto","year":"1996"},{"key":"10.1016\/S1571-0661(04)80985-X_NEWBIB7","unstructured":"Bretto A., H. Cherifi, and D. Aboutajdine, Hypergraph imaging: an overview. To appear in Pattern Recognition."},{"key":"10.1016\/S1571-0661(04)80985-X_NEWBIB8","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1006\/gmip.1997.0437","article-title":"Combinatorics and image processing","volume":"59","author":"Bretto","year":"1997","journal-title":"Graphical Models and Image Processing"},{"key":"10.1016\/S1571-0661(04)80985-X_NEWBIB9","doi-asserted-by":"crossref","unstructured":"Bretto A. and H. Cherifi, Noise detection and cleaning by hypergraph model. Proc. International Symposium on Information Technology: Coding and Computing (ITCC 2000, Las Vegas), IEEE Computer Society, 2000, 416\u2013419.","DOI":"10.1109\/ITCC.2000.844264"},{"key":"10.1016\/S1571-0661(04)80985-X_NEWBIB10","first-page":"59","article-title":"Helly type theorem for graphs","volume":"65","author":"Bretto","year":"2000","journal-title":"Rendiconti di Circulo di Matematica di Palermo, Ser II"},{"key":"10.1016\/S1571-0661(04)80985-X_NEWBIB11","unstructured":"Bretto A., S. Ub\u00e9da, and J. \u017derovnik, A polynomial algorithm for the strong Helly property. To appear in Information Processing Letters."},{"key":"10.1016\/S1571-0661(04)80985-X_NEWBIB12","series-title":"G\u00e9om\u00e9trie Discr\u00e8te en Analyse d'Images","author":"Chassery","year":"1991"},{"key":"10.1016\/S1571-0661(04)80985-X_NEWBIB13","doi-asserted-by":"crossref","first-page":"822","DOI":"10.1007\/BF01122734","article-title":"Domination in quadrangle-free Helly graphs","volume":"29","author":"Dragan","year":"1993","journal-title":"Cybernetics and Systems Analysis"},{"key":"10.1016\/S1571-0661(04)80985-X_NEWBIB14","series-title":"Probl\u00e8mes Combinatoires et Th\u00e9orie des Graphes","article-title":"Propri\u00e9t\u00e9 de Helly et problemes de representations","author":"Duchet","year":"1976"},{"key":"10.1016\/S1571-0661(04)80985-X_NEWBIB15","doi-asserted-by":"crossref","unstructured":"Fayek R.E. and A.K.C. Wong, Using hypergraph knowledge representation for natural terrain robot navigation and path planning. Proc. IEEE International Conference on Robotics and Automation (ICRA '96, Minneapolis), 1996, 3625\u20133630.","DOI":"10.1109\/ROBOT.1996.509265"},{"key":"10.1016\/S1571-0661(04)80985-X_NEWBIB16","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0012-365X(86)90031-2","article-title":"Neighborhood perfect graphs","volume":"61","author":"Lehel","year":"1986","journal-title":"Discrete Math"},{"key":"10.1016\/S1571-0661(04)80985-X_NEWBIB17","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/0097-3165(85)90061-5","article-title":"On the Helly property working as a compactness criterion on graphs","volume":"40","author":"Quilliot","year":"1985","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S1571-0661(04)80985-X_NEWBIB18","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1109\/TPAMI.1987.4767900","article-title":"Structuring free space as a hypergraph for roving robot path planning and navigation","volume":"9","author":"Rueb","year":"1987","journal-title":"IEEE Trans. PAMI"},{"key":"10.1016\/S1571-0661(04)80985-X_NEWBIB19","doi-asserted-by":"crossref","unstructured":"Stasse O. and Y. Kuniyoshi, Achieving efficiency and code re-usability in a programming system for complex robotic applications. Proc. IEEE International Conference on Robotics and Automation (ICRA 2000, San Francisco), 2000, 81\u201387.","DOI":"10.1109\/ROBOT.2000.844043"},{"key":"10.1016\/S1571-0661(04)80985-X_NEWBIB20","unstructured":"Tuza Zs., Applications of the set-pair method in extremal hypergraph theory. In: P. Frankl et al., editors, Extremal Problems for Finite Sets (Conference, Visegrad, 1991), Bolyai Society Mathematical Studies 3, 1994, 479\u2013514."},{"key":"10.1016\/S1571-0661(04)80985-X_NEWBIB21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0097-3165(93)90068-J","article-title":"Helly property in finite set systems","volume":"62","author":"Zs","year":"1993","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S1571-0661(04)80985-X_NEWBIB22","series-title":"Machine Intelligence and Knowledge Engineering for Robotic Applications (NATO Advanced Research Workshop, Maratea, 1986), NATO ASI Series","first-page":"113","article-title":"Knowledge representation for robot vision and path planning using attributed graphs and hypergraphs","author":"Wong","year":"1987"},{"key":"10.1016\/S1571-0661(04)80985-X_NEWBIB23","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1109\/34.21797","article-title":"Recognition and shape synthesis of 3D objects based on attributed hypergraphs","volume":"11","author":"Wong","year":"1989","journal-title":"IEEE Trans. PAMI"},{"key":"10.1016\/S1571-0661(04)80985-X_NEWBIB24","series-title":"Handbook of Discrete and Computational Geometry","first-page":"63","article-title":"Helly-type theorems and geometric transversals","author":"Wenger","year":"1997"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610480985X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610480985X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T10:55:23Z","timestamp":1549191323000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S157106610480985X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,8]]},"references-count":24,"alternative-id":["S157106610480985X"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80985-x","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2001,8]]}}}