{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T18:07:32Z","timestamp":1726423652587},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"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":[[2003,11]]},"DOI":"10.1016\/s0020-0190(03)00362-4","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T01:31:39Z","timestamp":1060306299000},"page":"121-131","source":"Crossref","is-referenced-by-count":2,"title":["Determination of the topology of a directed network"],"prefix":"10.1016","volume":"88","author":[{"given":"Darin","family":"Goldstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S0020-0190(03)00362-4_BIB001","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1109\/2.755008","article-title":"Mapping the Internet","volume":"32","author":"Burch","year":"1999","journal-title":"IEEE Comput."},{"issue":"1","key":"10.1016\/S0020-0190(03)00362-4_BIB002","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1006\/jagm.1996.0840","article-title":"Computing with snakes in directed networks of automata","volume":"24","author":"Even","year":"1997","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(03)00362-4_BIB003","series-title":"Proc. 13th Annual ACM-SIAM Symp. on Discrete Algorithms, San Francisco, CA","first-page":"578","article-title":"The wake up and report problem is asymptotically time-equivalent to the firing squad synchronization problem","author":"Goldstein","year":"2002"},{"key":"10.1016\/S0020-0190(03)00362-4_BIB004","series-title":"INFOCOM (3)","first-page":"1371","article-title":"Heuristics for Internet map discovery","author":"Govindan","year":"2000"},{"key":"10.1016\/S0020-0190(03)00362-4_BIB005","series-title":"ACM Symp. on Parallel Algorithms and Architectures","article-title":"System area network mapping","author":"Mainwaring","year":"1997"},{"year":"1967","series-title":"Computation: Finite and Infinite Machines","author":"Minsky","key":"10.1016\/S0020-0190(03)00362-4_BIB006"},{"key":"10.1016\/S0020-0190(03)00362-4_BIB007","series-title":"Proc. 14th Annual ACM Symp. on Principles of Distributed Computing, Ottawa, ON","first-page":"38","article-title":"Faster computation on directed networks of automata","author":"Ostrovsky","year":"1995"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019003003624?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019003003624?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T04:56:58Z","timestamp":1552625818000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019003003624"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,11]]}},"alternative-id":["S0020019003003624"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(03)00362-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[2003,11]]}}}