{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T22:40:21Z","timestamp":1691620821164},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,4,30]],"date-time":"2015-04-30T00:00:00Z","timestamp":1430352000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s00373-015-1576-8","type":"journal-article","created":{"date-parts":[[2015,4,29]],"date-time":"2015-04-29T11:51:20Z","timestamp":1430308280000},"page":"65-77","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Finding Shorter Cycles in a Weighted Graph"],"prefix":"10.1007","volume":"32","author":[{"given":"Fugang","family":"Chao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Han","family":"Ren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ni","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,30]]},"reference":[{"key":"1576_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, Berlin (2008)"},{"key":"1576_CR2","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connection with graphs. Numer. Math. 1, 55\u201361 (1959)","journal-title":"Numer. Math."},{"key":"1576_CR3","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Pulleyblank, W.R.: Weakly bipartite graphs and the max-cut problem. Oper. Res. Lett., 1, 23\u201327 (1981\/82)","DOI":"10.1016\/0167-6377(81)90020-1"},{"key":"1576_CR4","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1109\/TIT.2005.860472","volume":"52","author":"TR Halford","year":"2006","unstructured":"Halford, T.R., Chugg, K.M.: An algorithm for counting short cycles in bipartite graphs. IEEE Trans. Inf. Theory 52, 287\u2013292 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1576_CR5","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1137\/0216026","volume":"16","author":"JD Horton","year":"1987","unstructured":"Horton, J.D.: A polynomial-time algorithm to find the shortest cycle base of a graph. SIAM J. Comput. 16, 356\u2013366 (1987)","journal-title":"SIAM J. Comput."},{"key":"1576_CR6","doi-asserted-by":"crossref","first-page":"R16","DOI":"10.37236\/1354","volume":"5","author":"J Leydold","year":"1998","unstructured":"Leydold, J., Stadler, P.F.: Minimum cycle bases of outer planar graphs. Electronic J. Comb. 5, R16 (1998)","journal-title":"Electronic J. Comb."},{"key":"1576_CR7","doi-asserted-by":"crossref","first-page":"1645","DOI":"10.1049\/el:19961141","volume":"32","author":"DJC Mackay","year":"1996","unstructured":"Mackay, D.J.C., Neal, R.M.: Near Shannon limited performance of low density parity check codes. IEEE Electron. Lett. 32, 1645\u20131646 (1996)","journal-title":"IEEE Electron. Lett."},{"key":"1576_CR8","doi-asserted-by":"crossref","DOI":"10.56021\/9780801866890","volume-title":"Graphs on Surfaces","author":"B Mohar","year":"2001","unstructured":"Mohar, B., Thomassen, C.: Graphs on Surfaces. Johns Hopkins University Press, Baltimore (2001)"},{"key":"1576_CR9","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/BF02251238","volume":"31","author":"B Monien","year":"1983","unstructured":"Monien, B.: The complexity of determining a shortest cycle of even length. Computing 31, 355\u2013369 (1983)","journal-title":"Computing"},{"key":"1576_CR10","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF02020254","volume":"9","author":"I Reiman","year":"1958","unstructured":"Reiman, I.: \u00dcber ein Problem von K. Zarankiewicz. Acta Math. Acad. Sci. Hung. 9, 269\u2013273 (1958)","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"1576_CR11","doi-asserted-by":"crossref","first-page":"2654","DOI":"10.1016\/j.disc.2006.11.020","volume":"307","author":"H Ren","year":"2007","unstructured":"Ren, H., Deng, M.: Minimum cycle bases of graphs on surfaces. Discrete Math. 307, 2654\u20132660 (2007)","journal-title":"Discrete Math."},{"key":"1576_CR12","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0095-8956(90)90115-G","volume":"48","author":"C Thomassen","year":"1990","unstructured":"Thomassen, C.: Embeddings of graphs with no short non-contractible cycles. J. Comb. Theory Ser. B 48, 155\u2013177 (1990)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1576_CR13","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1006\/jctb.1993.1057","volume":"59","author":"C Thomassen","year":"1993","unstructured":"Thomassen, C.: Five-coloring maps on surfaces. J. Comb. Theory Ser. B 59, 89\u2013105 (1993)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1576_CR14","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1137\/S0895480194274133","volume":"10","author":"R Yuster","year":"1997","unstructured":"Yuster, R., Zwick, U.: Finding even cycles even faster. SIAM J. Discrete Math. 10, 209\u2013222 (1997)","journal-title":"SIAM J. Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1576-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-015-1576-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1576-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T21:59:17Z","timestamp":1691618357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-015-1576-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,30]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["1576"],"URL":"https:\/\/doi.org\/10.1007\/s00373-015-1576-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,30]]}}}