{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T18:25:15Z","timestamp":1778610315268,"version":"3.51.4"},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,9,1]],"date-time":"1990-09-01T00:00:00Z","timestamp":652147200000},"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":8355,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1990,9]]},"DOI":"10.1016\/0166-218x(90)90011-z","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"303-307","source":"Crossref","is-referenced-by-count":32,"title":["Succinct representation of general unlabeled graphs"],"prefix":"10.1016","volume":"28","author":[{"given":"Moni","family":"Naor","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90011-Z_BIB1","author":"Devroy","year":"1986"},{"key":"10.1016\/0166-218X(90)90011-Z_BIB2","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1145\/73007.73039","article-title":"Implicit O(1) probe search","author":"Fiat","year":"1989","journal-title":"Proceedings Twenty-first ACM Symposium on the Theory of Computing"},{"key":"10.1016\/0166-218X(90)90011-Z_BIB3","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1145\/62212.62245","article-title":"Storing and searching a multikey table","author":"Fiat","year":"1988","journal-title":"Proceedings Twentieth ACM Symposium on the Theory of Computing"},{"key":"10.1016\/0166-218X(90)90011-Z_BIB4","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1145\/62212.62248","article-title":"Non-oblivious hashing","author":"Fiat","year":"1988","journal-title":"Proceedings Twentieth ACM Symposium on the Theory of Computing"},{"key":"10.1016\/0166-218X(90)90011-Z_BIB5","first-page":"440","article-title":"Compression and ranking","author":"Goldberg","year":"1985","journal-title":"Proceedings Seventeeth ACM Symposium on the Theory of Computing"},{"key":"10.1016\/0166-218X(90)90011-Z_BIB6","series-title":"Ramsey Theory","author":"Graham","year":"1980"},{"key":"10.1016\/0166-218X(90)90011-Z_BIB7","author":"Harary","year":"1973"},{"key":"10.1016\/0166-218X(90)90011-Z_BIB8","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0166-218X(84)90126-4","article-title":"On the succinct representation of graphs","volume":"8","author":"Turan","year":"1984","journal-title":"Discrete Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090011Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090011Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:57:31Z","timestamp":1555120651000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9090011Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,9]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,9]]}},"alternative-id":["0166218X9090011Z"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90011-z","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,9]]}}}