{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T20:28:54Z","timestamp":1776889734538,"version":"3.51.2"},"reference-count":16,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1987,4]]},"DOI":"10.1137\/0216026","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T11:28:18Z","timestamp":1109244498000},"page":"358-366","source":"Crossref","is-referenced-by-count":217,"title":["A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph"],"prefix":"10.1137","volume":"16","author":[{"given":"J. D.","family":"Horton","sequence":"first","affiliation":[]}],"member":"351","reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1109\/TCT.1973.1083752"},{"key":"R2","first-page":"221","volume":"32","author":"Cribb D. W.","year":"1981","journal-title":"Congr. Numer."},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1109\/TCS.1979.1084563"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1145\/355984.355988"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230060206"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368168"},{"key":"R8","first-page":"283","volume-title":"Recent advances in graph theory (Proc. Second Czechoslovak Sympos., Prague, 1974)","author":"Hubicka El\u017cbieta","year":"1975"},{"key":"R9","unstructured":"D. E. Knuth, The Art of Computer Programming, Vol. 1, Addison-Wesley, Reading, MA, 1968, 363\u20133700191.17903"},{"key":"R10","first-page":"631","volume":"16","author":"Kolasinska E.","year":"1980","journal-title":"Zastos. Mat."},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1137\/0205007"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1145\/363219.363232"},{"key":"R14","first-page":"171","volume":"19","author":"Stepanec G. F.","year":"1964","journal-title":"Uspehi Mat. Nauk"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230090203"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1137\/0210062"},{"key":"R17","unstructured":"A. A. Zykov, Teoriya konechnykh grafov. I, Izdat. \u201cNauka\u201d Sibirsk. Otdel., Novosibirsk, 1969, 543\u2013, (In Russian.)42:5847"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0216026","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,1,29]],"date-time":"2017-01-29T17:19:36Z","timestamp":1485710376000},"score":1,"resource":{"primary":{"URL":"http:\/\/epubs.siam.org\/doi\/10.1137\/0216026"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,4]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,4]]}},"alternative-id":["10.1137\/0216026"],"URL":"https:\/\/doi.org\/10.1137\/0216026","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,4]]}}}