{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T09:41:27Z","timestamp":1775209287527,"version":"3.50.1"},"reference-count":4,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1976,1,1]],"date-time":"1976-01-01T00:00:00Z","timestamp":189302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1976,1]]},"DOI":"10.1016\/0020-0190(76)90049-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"83-84","source":"Crossref","is-referenced-by-count":152,"title":["Subgraph isomorphism, matching relational structures and maximal cliques"],"prefix":"10.1016","volume":"4","author":[{"given":"H.G.","family":"Barrow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.M.","family":"Burstall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(76)90049-1_BIB1","first-page":"298","article-title":"A versatile computer-controlled assembly system","author":"Ambler","year":"1973","journal-title":"Proc. of Third Intern. Joint Conf. Artificial Intelligence"},{"key":"10.1016\/0020-0190(76)90049-1_BIB2","first-page":"575","article-title":"Algorithm 457: finding all the cliques of an undirected graph","volume":"16","author":"Bron","year":"1973","journal-title":"C.A.C.M."},{"key":"10.1016\/0020-0190(76)90049-1_BIB3","series-title":"Cliques of a graph \u2014 large or small","author":"Johnston","year":"1974"},{"key":"10.1016\/0020-0190(76)90049-1_BIB4","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019076900491?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019076900491?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:25:05Z","timestamp":1555086305000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019076900491"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,1]]},"references-count":4,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1976,1]]}},"alternative-id":["0020019076900491"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(76)90049-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1976,1]]}}}