{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T21:56:33Z","timestamp":1775512593640,"version":"3.50.1"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[1972,3,1]],"date-time":"1972-03-01T00:00:00Z","timestamp":68256000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1972,3]]},"DOI":"10.1007\/bf01706081","type":"journal-article","created":{"date-parts":[[2005,6,21]],"date-time":"2005-06-21T09:20:54Z","timestamp":1119345654000},"page":"103-106","source":"Crossref","is-referenced-by-count":18,"title":["On the time required to detect cycles and connectivity in graphs"],"prefix":"10.1007","volume":"6","author":[{"given":"Richard C.","family":"Holt","sequence":"first","affiliation":[]},{"given":"Edward M.","family":"Reingold","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01706081_CR1","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. Dijkstra","year":"1959","unstructured":"E. Dijkstra, A note on two problems in connection with graphs,Numer. Math 1 (1959), 269\u2013271.","journal-title":"Numer. Math"},{"key":"BF01706081_CR2","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/opre.17.3.395","volume":"17","author":"D. Dreyfus","year":"1969","unstructured":"D. Dreyfus, An appraisal of some shortest path algorithms,Operations Res. 17 (1969), 395\u2013412.","journal-title":"Operations Res."},{"key":"BF01706081_CR3","unstructured":"J. Hopcroft andR. Tarjan, Planarity testing in V log V steps, to appear in IFIP, 1971."},{"key":"BF01706081_CR4","unstructured":"L. Kerr, personal correspondence."},{"key":"BF01706081_CR5","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1145\/320964.320973","volume":"6","author":"R. B. Marimont","year":"1959","unstructured":"R. B. Marimont, A new method of checking the consistency of precedence matrices,J. Assoc. Comput. Mach. 6 (1959), 164\u2013171.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01706081_CR6","unstructured":"E. McCreight, unpublished."},{"key":"BF01706081_CR7","volume-title":"A theory of bi-directional search in path problems, Report No. RC 2713","author":"I. Pohl","year":"1969","unstructured":"I. Pohl, A theory of bi-directional search in path problems, Report No. RC 2713, IBM, Yorktown Heights, N.Y., 1969."}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01706081.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01706081\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01706081","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T12:32:17Z","timestamp":1557318737000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01706081"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1972,3]]},"references-count":7,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1972,3]]}},"alternative-id":["BF01706081"],"URL":"https:\/\/doi.org\/10.1007\/bf01706081","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1972,3]]}}}