{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T14:17:07Z","timestamp":1768313827932,"version":"3.49.0"},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2002,9,16]],"date-time":"2002-09-16T00:00:00Z","timestamp":1032134400000},"content-version":"unspecified","delay-in-days":46,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2002,8]]},"abstract":"<jats:p>Graph pattern matching is a central problem in many application fields. Since it is \nNP-<jats:italic>complete<\/jats:italic>, we cannot expect to find algorithms with a good worst-case performance. \nHowever, there is still room for general procedures with a good average performance. In this \npaper we explore four different solving approaches within the constraint satisfaction \nframework, and introduce a new algorithm, which we call nRF+. The algorithm is a \nrefinement of <jats:italic>really full look ahead<\/jats:italic> that takes advantage of the problem structure in order \nto enhance the look ahead procedure. We give a formal proof that nRF+ is superior to the \nother approaches in terms of number of visited nodes. An additional contribution of this \npaper is the introduction of a new benchmark for testing algorithms in this domain. It is \nformed by a large set of well-defined graphs of very diverse nature. In this benchmark, we \nshow that nRF+ can efficiently solve a broad range of problems, while still leaving many \nproblem instances unsolved. The use of this challenging benchmark is encouraged for future \nalgorithms evaluation.<\/jats:p>","DOI":"10.1017\/s0960129501003577","type":"journal-article","created":{"date-parts":[[2002,9,20]],"date-time":"2002-09-20T12:50:31Z","timestamp":1032526231000},"page":"403-422","source":"Crossref","is-referenced-by-count":85,"title":["Constraint satisfaction algorithms for graph \npattern matching"],"prefix":"10.1017","volume":"12","author":[{"given":"JAVIER","family":"LARROSA","sequence":"first","affiliation":[]},{"given":"GABRIEL","family":"VALIENTE","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2002,9,16]]},"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129501003577","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T19:33:15Z","timestamp":1554319995000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129501003577\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,8]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,8]]}},"alternative-id":["S0960129501003577"],"URL":"https:\/\/doi.org\/10.1017\/s0960129501003577","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,8]]}}}