{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T08:37:48Z","timestamp":1704184668455},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,4,1]],"date-time":"1991-04-01T00:00:00Z","timestamp":670464000000},"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":8143,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1991,4]]},"DOI":"10.1016\/0890-5401(91)90065-a","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T15:34:26Z","timestamp":1103211266000},"page":"177-188","source":"Crossref","is-referenced-by-count":3,"title":["Connectivity vs. reachability"],"prefix":"10.1016","volume":"91","author":[{"given":"M.","family":"Chrobak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Karloff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Radzik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(91)90065-A_BIB1","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0020-0190(89)90214-7","article-title":"A generalized model for understanding evasiveness","volume":"30","author":"Aggarwal","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(91)90065-A_BIB2","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","article-title":"On the complexity of timetable and multicommodity flow problems","volume":"5","author":"Even","year":"1976","journal-title":"SIAM. J. Comput."},{"key":"10.1016\/0890-5401(91)90065-A_BIB3","series-title":"Proceedings, 20th ACM STOC'88","first-page":"186","article-title":"On the communication complexity of graph properties","author":"Hajnal","year":"1988"},{"key":"10.1016\/0890-5401(91)90065-A_BIB4","series-title":"Proceedings, 20th ACM STOC'88","first-page":"539","article-title":"Monotone circuits for connectivity require super-logarithmic depth","author":"Karchmer","year":"1988"},{"key":"10.1016\/0890-5401(91)90065-A_BIB5","series-title":"Proceedings, 29th IEEE FOCS'88","first-page":"81","article-title":"Lattices, M\u00f6bius functions and communication complexity","author":"Lov\u00e1sz","year":"1988"},{"key":"10.1016\/0890-5401(91)90065-A_BIB6","series-title":"An \u03a9(log2 n) monotone depth lower bound for connectivity","author":"Raz","year":"1989"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190065A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190065A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T20:25:43Z","timestamp":1548879943000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019190065A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,4]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,4]]}},"alternative-id":["089054019190065A"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(91)90065-a","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1991,4]]}}}