{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T22:13:38Z","timestamp":1774044818708,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540088608","type":"print"},{"value":"9783540358077","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1978]]},"DOI":"10.1007\/3-540-08860-1_21","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T11:34:19Z","timestamp":1330169659000},"page":"289-299","source":"Crossref","is-referenced-by-count":29,"title":["Covering a graph by circuits"],"prefix":"10.1007","author":[{"given":"Alon","family":"Itai","sequence":"first","affiliation":[]},{"given":"Michael","family":"Rodeh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"21_CR1","unstructured":"A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, (1974)."},{"key":"21_CR2","unstructured":"H. Cross, \"Analysis of Flow in Networks of Conduits of Conductors\", Bull. No. 286, Univ. of Illinois Engineering Experimental Station, Urbana, Ill. (1936)."},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/BF01580113","volume":"5","author":"J. Edmonds","year":"1973","unstructured":"J. Edmonds and E.L. Johnson, \"Matching, Euler Tours and the Chinese Postman\", Math. Programming 5 (1973), 88\u2013124.","journal-title":"Math. Programming"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J. Edmonds","year":"1972","unstructured":"J. Edmonds, and R.M. Karp, \"Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems\", J. ACM 19 (1972) 248\u2013264.","journal-title":"J. ACM"},{"key":"21_CR5","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF02276756","volume":"17","author":"T. Kameda","year":"1976","unstructured":"T. Kameda, \"On Maximally Distant Spanning Trees of a Graph\", Computing 17 (1976), 115\u2013119.","journal-title":"Computing"},{"key":"21_CR6","unstructured":"C.L. Liu, Introduction to Combinatorial Mathematics, McGraw-Hill (1968)."},{"key":"21_CR7","unstructured":"M.O. Rabin, \"Probabilistic Algorithms\", Proc. Sym. on New Directions and Recent Results in Algorithms and Complexity, Carnegie-Mellon University, Academic Press (April 1976)."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-08860-1_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T16:54:54Z","timestamp":1619542494000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-08860-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"ISBN":["9783540088608","9783540358077"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-08860-1_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1978]]}}}