{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:29:31Z","timestamp":1750307371709,"version":"3.41.0"},"reference-count":2,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[1974,1,1]],"date-time":"1974-01-01T00:00:00Z","timestamp":126230400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGACT News"],"published-print":{"date-parts":[[1974,1]]},"abstract":"<jats:p>\n            In a recent paper [1], Rosenberg conjectures that the results found in Holt and Reingold [2], can be generalized. Suppose that graphs are presented via their adjacency matrices. Then Holt and Reingold show that any algorithm which detects whether or not a graph is strongly connected (respectively, contains a cycle) must in worst case probe 0(n\n            <jats:sup>2<\/jats:sup>\n            ) entries of the given n x n adjacency matrix. Rosenberg then considers restrictions on graph property P such that any algorithm takes in worst case 0(n\n            <jats:sup>2<\/jats:sup>\n            ) probes to determine whether or not a n-node graph has property P.\n          <\/jats:p>","DOI":"10.1145\/1811129.1811133","type":"journal-article","created":{"date-parts":[[2010,6,11]],"date-time":"2010-06-11T18:52:51Z","timestamp":1276282371000},"page":"30-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["On the Aanderaa-Rosenberg Conjecture"],"prefix":"10.1145","volume":"6","author":[{"given":"Richard J.","family":"Lipton","sequence":"first","affiliation":[{"name":"Yale University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lawrence","family":"Snvder","sequence":"additional","affiliation":[{"name":"Yale University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[1974,1]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_2_1_1_1","DOI":"10.1145\/1008299.1008302"},{"doi-asserted-by":"publisher","key":"e_1_2_1_2_1","DOI":"10.1007\/BF01706081"}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1811129.1811133","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1811129.1811133","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:22:54Z","timestamp":1750245774000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1811129.1811133"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,1]]},"references-count":2,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1974,1]]}},"alternative-id":["10.1145\/1811129.1811133"],"URL":"https:\/\/doi.org\/10.1145\/1811129.1811133","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[1974,1]]},"assertion":[{"value":"1974-01-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}