{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T16:07:23Z","timestamp":1758816443086,"version":"3.30.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,4,1]],"date-time":"1995-04-01T00:00:00Z","timestamp":796694400000},"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":[[1995,4]]},"DOI":"10.1016\/0020-0190(94)00231-m","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:04:31Z","timestamp":1027649071000},"page":"55-58","source":"Crossref","is-referenced-by-count":14,"title":["On finding a cycle basis with a shortest maximal cycle"],"prefix":"10.1016","volume":"54","author":[{"given":"David M.","family":"Chickering","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Geiger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Heckerman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)00231-M_BIB1","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","article-title":"On the inherent intractability of certain coding problems","volume":"24","author":"Berlekamp","year":"1978","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0020-0190(94)00231-M_BIB2","first-page":"221","article-title":"On cycle bases of a graph","volume":"32","author":"Cribb","year":"1981"},{"key":"10.1016\/0020-0190(94)00231-M_BIB3","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1109\/TCS.1979.1084563","article-title":"Minimum length fundamental cycle set","volume":"26","author":"Deo","year":"1979","journal-title":"IEEE Trans. Circuits and Systems"},{"key":"10.1016\/0020-0190(94)00231-M_BIB4","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1145\/355984.355988","article-title":"Algorithms for generating fundamental cycles in a graph","volume":"8","author":"Deo","year":"1982","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/0020-0190(94)00231-M_BIB5","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1137\/0216026","article-title":"A polynomial-time algorithm to find the shortest cycle basis of a graph","volume":"16","author":"Horton","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)00231-M_BIB6","series-title":"Proc. Symp. on Recent Advances in Graph Theory","first-page":"283","article-title":"Minimal bases of cycles of a graph","author":"Hubicka","year":"1975"},{"key":"10.1016\/0020-0190(94)00231-M_BIB7","first-page":"631","article-title":"On a minimum cycle basis of a graph","volume":"16","author":"Kolasinska","year":"1980","journal-title":"Zastos. Mat."},{"key":"10.1016\/0020-0190(94)00231-M_BIB8","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1111\/j.2517-6161.1988.tb01721.x","article-title":"Local comomputations with probabilities on graphical structures and their application to expert system","volume":"50","author":"Lauritzen","year":"1988","journal-title":"J. Roy. Statist. Soc. Ser. B"},{"key":"10.1016\/0020-0190(94)00231-M_BIB9","first-page":"171","article-title":"Basis systems of vector cycles with extremal properties in graphs","volume":"19","author":"Stepanec","year":"1964","journal-title":"Uspekhi Mat. Nauk"},{"key":"10.1016\/0020-0190(94)00231-M_BIB10","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1002\/net.3230090203","article-title":"On cycle bases of a graph","volume":"9","author":"Syslo","year":"1979","journal-title":"Networks"},{"year":"1992","series-title":"Graphs: Theory and Algorithms","author":"Thulasiraman","key":"10.1016\/0020-0190(94)00231-M_BIB11"},{"year":"1969","series-title":"Theory of Finite Graphs","author":"Zykov","key":"10.1016\/0020-0190(94)00231-M_BIB12"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909400231M?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909400231M?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T12:40:48Z","timestamp":1733488848000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909400231M"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,4]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,4]]}},"alternative-id":["002001909400231M"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00231-m","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[1995,4]]}}}