{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:28:17Z","timestamp":1759638497540},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175138"},{"type":"electronic","value":"9783642175145"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17514-5_7","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T20:09:23Z","timestamp":1291406963000},"page":"73-84","source":"Crossref","is-referenced-by-count":1,"title":["k-cyclic Orientations of Graphs"],"prefix":"10.1007","author":[{"given":"Yasuaki","family":"Kobayashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuichiro","family":"Miyamoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hisao","family":"Tamaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"7_CR1","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/0095-8956(78)90078-3","volume":"24","author":"V. Chv\u00e1tal","year":"1978","unstructured":"Chv\u00e1tal, V., Thomassen, C.: Distances in orientations of graphs. Journal of Combinatorial Theory, Series B\u00a024(1), 65\u201375 (1978)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"1-3","key":"7_CR2","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.dam.2004.01.005","volume":"143","author":"P. Dankelmann","year":"2004","unstructured":"Dankelmann, P., Oellermann, O.R., Wu, J.-L.: Minimum average distance of strong orientations of graphs. Discrete Appl. Math.\u00a0143(1-3), 204\u2013212 (2004)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.endm.2009.07.043","volume":"34","author":"N. Eggemann","year":"2009","unstructured":"Eggemann, N., Noble, S.D.: Minimizing the oriented diameter of a planar graph. Electronic Notes in Discrete Mathematics\u00a034(1), 267\u2013271 (2009)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"7_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0020-0190(97)00129-4","volume":"63","author":"S. Louis Hakimi","year":"1997","unstructured":"Louis Hakimi, S., Schmeichel, E.F., Young, N.E.: Orienting graphs to optimize reachability. Information Processing Letters\u00a063, 229\u2013235 (1997)","journal-title":"Information Processing Letters"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-10631-6_42","volume-title":"Algorithms and Computation","author":"T. Ito","year":"2009","unstructured":"Ito, T., Miyamoto, Y., Ono, H., Tamaki, H., Uehara, R.: Route-enabling graph orientation problems. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 403\u2013412. Springer, Heidelberg (2009)"},{"issue":"5","key":"7_CR7","doi-asserted-by":"publisher","first-page":"281","DOI":"10.2307\/2303897","volume":"46","author":"H.E. Robbins","year":"1939","unstructured":"Robbins, H.E.: A theorem on graphs, with an application to a problem of traffic control. The American Mathematical Monthly\u00a046(5), 281\u2013283 (1939)","journal-title":"The American Mathematical Monthly"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17514-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T16:52:23Z","timestamp":1553273543000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17514-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175138","9783642175145"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17514-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}