{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:11:21Z","timestamp":1725567081594},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280613"},{"type":"electronic","value":"9783540318064"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11533719_88","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:34:13Z","timestamp":1127828053000},"page":"870-884","source":"Crossref","is-referenced-by-count":3,"title":["Approximating the Longest Cycle Problem on Graphs with Bounded Degree"],"prefix":"10.1007","author":[{"given":"Guantao","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhicheng","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xingxing","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenan","family":"Zang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"88_CR1","doi-asserted-by":"publisher","first-page":"1395","DOI":"10.1137\/S0097539702416761","volume":"32","author":"A. Bj\u00f6rklund","year":"2003","unstructured":"Bj\u00f6rklund, A., Husfeldt, T.: Finding a path of superlogarithmic length. SIAM J. Comput.\u00a032, 1395\u20131402 (2003)","journal-title":"SIAM J. Comput."},{"key":"88_CR2","doi-asserted-by":"publisher","first-page":"1136","DOI":"10.1137\/S0097539703436473","volume":"33","author":"G. Chen","year":"2004","unstructured":"Chen, G., Xu, J., Yu, X.: Circumference of graphs with bounded degree. SIAM J. Comput.\u00a033, 1136\u20131170 (2004)","journal-title":"SIAM J. Comput."},{"key":"88_CR3","doi-asserted-by":"publisher","first-page":"1596","DOI":"10.1137\/S0097539701395486","volume":"31","author":"T. Feder","year":"2002","unstructured":"Feder, T., Motwani, R., Subi, C.: Approximating the longest cycle problem in sparse graphs. SIAM J. Comput.\u00a031, 1596\u20131607 (2002)","journal-title":"SIAM J. Comput."},{"key":"88_CR4","unstructured":"Feder, T., Motwani, R.: Finding a long cycle in a graph with a degree bound and a 3-cyclable minor. Manuscript (2004)"},{"key":"88_CR5","doi-asserted-by":"crossref","unstructured":"Gabow, H.N.: Finding paths and cycles of superpolylogarithmic length. In: Proc. 36th annual ACM symposium on Theory of Computing (STOC), Chicago, pp. 407\u2013416 (2004)","DOI":"10.1145\/1007352.1007418"},{"key":"88_CR6","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Dividing a graph into triconnected components. SIAM J. Comput.\u00a02, 135\u2013158 (1973)","journal-title":"SIAM J. Comput."},{"key":"88_CR7","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/BF01758778","volume":"7","author":"T. Ibaraki","year":"1992","unstructured":"Ibaraki, T., Nagamochi, H.: A linear-time algorithm for finding a sparse kconnected spanning subgraph of a k-connected graph. Algorithmica\u00a07, 583\u2013596 (1992)","journal-title":"Algorithmica"},{"key":"88_CR8","first-page":"237","volume-title":"Graphs, Matrices, and Designs","author":"B. Jackson","year":"1993","unstructured":"Jackson, B., Wormald, N.C.: Longest cycles in 3-connected graphs of bounded maximum degree. In: Rees, R.S. (ed.) Graphs, Matrices, and Designs, pp. 237\u2013254. Marcel and Dekker, Inc., New York (1993)"},{"key":"88_CR9","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/BF02523689","volume":"18","author":"D. Karger","year":"1997","unstructured":"Karger, D., Motwani, R., Ramkumar, G.D.S.: On approximating the longest path in a graph. Algorithmica\u00a018, 82\u201398 (1997)","journal-title":"Algorithmica"},{"key":"88_CR10","doi-asserted-by":"crossref","unstructured":"Tutte, W.T.: Connectivity in Graphs. University of Toronto Press (1966)","DOI":"10.3138\/9781487584863"},{"key":"88_CR11","doi-asserted-by":"publisher","first-page":"378","DOI":"10.2307\/1968197","volume":"32","author":"H. Whitney","year":"1931","unstructured":"Whitney, H.: A theorem on graphs. Ann. of Math.\u00a032, 378\u2013390 (1931)","journal-title":"Ann. of Math."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11533719_88","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T22:37:09Z","timestamp":1586471829000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11533719_88"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280613","9783540318064"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11533719_88","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}