{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T14:56:28Z","timestamp":1777733788104,"version":"3.51.4"},"reference-count":4,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"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":["Social Networks"],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1016\/s0378-8733(01)00035-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T09:23:11Z","timestamp":1027588991000},"page":"237-243","source":"Crossref","is-referenced-by-count":96,"title":["A subquadratic triad census algorithm for large sparse networks with small maximum degree"],"prefix":"10.1016","volume":"23","author":[{"given":"Vladimir","family":"Batagelj","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrej","family":"Mrvar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0378-8733(01)00035-1_BIB1","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0378-4371(99)00291-5","article-title":"Mean-field theory for scale-free random networks","volume":"272","author":"Barabasi","year":"1999","journal-title":"Physica A"},{"issue":"2","key":"10.1016\/S0378-8733(01)00035-1_BIB2","first-page":"47","article-title":"Pajek\u2014a program for large network analysis","volume":"21","author":"Batagelj","year":"1998","journal-title":"Connections"},{"key":"10.1016\/S0378-8733(01)00035-1_BIB3","doi-asserted-by":"crossref","unstructured":"Wasserman, S., Faust, K., 1994. Social Network Analysis. Cambridge University Press, Cambridge.","DOI":"10.1017\/CBO9780511815478"},{"key":"10.1016\/S0378-8733(01)00035-1_BIB4","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0378-8733(98)00006-9","article-title":"Matrix methods for calculating the triad census","volume":"20","author":"Moody","year":"1998","journal-title":"Social Networks"}],"container-title":["Social Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0378873301000351?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0378873301000351?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T06:25:00Z","timestamp":1556951100000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0378873301000351"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S0378873301000351"],"URL":"https:\/\/doi.org\/10.1016\/s0378-8733(01)00035-1","relation":{},"ISSN":["0378-8733"],"issn-type":[{"value":"0378-8733","type":"print"}],"subject":[],"published":{"date-parts":[[2001,7]]}}}