{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:51:09Z","timestamp":1725501069835},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744498"},{"type":"electronic","value":"9783540744504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74450-4_17","type":"book-chapter","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T01:49:24Z","timestamp":1189734564000},"page":"186-197","source":"Crossref","is-referenced-by-count":0,"title":["Constrained Cycle Covers in Halin Graphs"],"prefix":"10.1007","author":[{"given":"Yueping","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J.: Easy problems for tree-decomposable graphs. Journal of Algorithms\u00a012, 308\u2013349 (1991)","journal-title":"Journal of Algorithms"},{"key":"17_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph theory with application","author":"J.A. Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph theory with application. Macmillan, London (1976)"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/BF02591867","volume":"26","author":"G. Cornuejols","year":"1983","unstructured":"Cornuejols, G., Naddef, D., Pulleyblank, W.: Halin graphs and the traveling salesman problem. Mathematical Programming\u00a026, 287\u2013294 (1983)","journal-title":"Mathematical Programming"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1145\/3149.3154","volume":"32","author":"G. Cornuejols","year":"1985","unstructured":"Cornuejols, G., Naddef, D., Pulleyblank, W.: The traveling salesman problem in graphs with 3-edge cutsets. Journal of ACM\u00a032, 383\u2013410 (1985)","journal-title":"Journal of ACM"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1287\/ijoc.13.2.104.10516","volume":"13","author":"D.S. Hochbaum","year":"2001","unstructured":"Hochbaum, D.S., Olinick, E.V.: The bounded cycle-cover problem. INFORMS Journal on Computing\u00a013, 104\u2013119 (2001)","journal-title":"INFORMS Journal on Computing"},{"key":"17_CR6","unstructured":"Li, Y.P., Lou, D.J., Lu, Y.T.: Algorithms for the optimal hamiltonian path in Halin graphs. Ars Combinatoria (accepted)"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1023\/A:1014444525059","volume":"34","author":"G. Pesant","year":"2002","unstructured":"Pesant, G., Soriano, P.: An optimal strategy for the constrainted cycle cover problem. Annuals of Mathematics and Ariticial Intelligence\u00a034, 313\u2013325 (2002)","journal-title":"Annuals of Mathematics and Ariticial Intelligence"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0166-218X(87)90031-X","volume":"17","author":"P. Winter","year":"1987","unstructured":"Winter, P.: Steiner problem in halin graphs. Discrete Apply. Math.\u00a017, 281\u2013294 (1987)","journal-title":"Discrete Apply. Math."},{"key":"17_CR9","volume-title":"Fiber network service survivability","author":"T.H. Wu","year":"1992","unstructured":"Wu, T.H.: Fiber network service survivability. Artech House, Norwood, MA (1992)"}],"container-title":["Lecture Notes in Computer Science","Combinatorics, Algorithms, Probabilistic and Experimental Methodologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74450-4_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:28:03Z","timestamp":1619504883000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74450-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744498","9783540744504"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74450-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}