{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T13:24:38Z","timestamp":1726406678492},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540102915"},{"type":"electronic","value":"9783540384359"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-10291-4_27","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:10:00Z","timestamp":1330189800000},"page":"367-378","source":"Crossref","is-referenced-by-count":0,"title":["Alternating cycle covers and paths"],"prefix":"10.1007","author":[{"given":"Oliver","family":"Vornberger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"key":"27_CR1","unstructured":"M. Garey, D. Johnson: \"Computers and Intractibility, A guide to the Theory of NP-Completeness\", San Francisco 1979"},{"key":"27_CR2","unstructured":"N. Christofides: \" Graph Theory, An Algorithmic Approach\", Academic press, 1975"},{"key":"27_CR3","first-page":"179","volume":"4","author":"W. Savitch","year":"1970","unstructured":"W. Savitch: \" Relationships between nondeterministic and deterministic Tape Complexities\", ICSS 4 (1970) pp. 179\u2013192","journal-title":"ICSS"},{"key":"27_CR4","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1002\/zamm.19770570607","volume":"57","author":"B. Monien","year":"1977","unstructured":"B. Monien, D. Janssen: \" \u00dcber die Komplexit\u00e4t der Fehlerdiagnose bei Systemen\", ZAMM 57 (1977) pp. 315\u2013317","journal-title":"ZAMM"},{"key":"27_CR5","unstructured":"O. Vornberger: \"Komplexit\u00e4t von Wegeproblemen in Graphen\" Bericht Nr. 5, Reihe Theoretische Informatik, FB 17 der GH Paderborn"}],"container-title":["Lecture Notes in Computer Science","Graphtheoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10291-4_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:36:55Z","timestamp":1619555815000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10291-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540102915","9783540384359"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-10291-4_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}