{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T06:00:08Z","timestamp":1649138408071},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,11,1]],"date-time":"1994-11-01T00:00:00Z","timestamp":783648000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6833,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,11]]},"DOI":"10.1016\/0304-3975(94)90286-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"209-223","source":"Crossref","is-referenced-by-count":0,"title":["A bijection between cliques in graphs and factorizations in free monoids"],"prefix":"10.1016","volume":"134","author":[{"given":"J.-C.","family":"Spehner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90286-0_BIB1","series-title":"Proc. 3rd Am. ACM. Symp. on Theory of Computing","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/0304-3975(94)90286-0_BIB2","series-title":"Computers and Intractibility, A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(94)90286-0_BIB3","series-title":"Complexity of Computers Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0304-3975(94)90286-0_BIB4","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF02760024","article-title":"On cliques in graphs","author":"Moon","year":"1965","journal-title":"Isra\u00ebl J. Math."},{"key":"10.1016\/0304-3975(94)90286-0_BIB5","first-page":"545","article-title":"A property of finitely generated submonoids","volume":"Vol. 20","author":"Sch\u00fctzenberger","year":"1976"},{"key":"10.1016\/0304-3975(94)90286-0_BIB6","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/BF02194863","article-title":"Quelques constructions et algorithmes relatifs aux sous-mono\u00efdes d'un monoide libre","volume":"9","author":"Spehner","year":"1975","journal-title":"Semigroup Forum"},{"key":"10.1016\/0304-3975(94)90286-0_BIB7","article-title":"Quelques probl\u00e8mes d'extension, de conjugaison et de pr\u00e9sentation des sous-mono\u00efdes d'un mono\u00efde libre","volume":"7","author":"Spehner","year":"1976","journal-title":"Th\u00e8se"},{"key":"10.1016\/0304-3975(94)90286-0_BIB8","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/BF02572842","article-title":"Sur la classification syntaxique","volume":"26","author":"Spehner","year":"1983","journal-title":"Semigroup Forum"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594902860?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594902860?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:50:18Z","timestamp":1555116618000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594902860"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,11]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,11]]}},"alternative-id":["0304397594902860"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90286-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,11]]}}}