{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T01:23:32Z","timestamp":1725758612077},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642452772"},{"type":"electronic","value":"9783642452789"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45278-9_28","type":"book-chapter","created":{"date-parts":[[2013,11,25]],"date-time":"2013-11-25T15:35:18Z","timestamp":1385393718000},"page":"327-336","source":"Crossref","is-referenced-by-count":0,"title":["Construction Techniques for Digraphs with Minimum Diameter"],"prefix":"10.1007","author":[{"given":"Mirka","family":"Miller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Slamin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joe","family":"Ryan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edy Tri","family":"Baskoro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","first-page":"161","volume":"24","author":"E.T. Baskoro","year":"1997","unstructured":"Baskoro, E.T., Brankovi\u0107, L., Miller, M., Plesn\u00edk, J., Ryan, J., Sir\u00e1\u0148, J.: Large digraphs with small diameter: A voltage assignment approach. JCMCC\u00a024, 161\u2013176 (1997)","journal-title":"JCMCC"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/0095-8956(80)90091-X","volume":"B29","author":"W.G. Bridges","year":"1980","unstructured":"Bridges, W.G., Toueg, S.: On the impossibility of directed Moore graphs. J. Combinatorial Theory Series\u00a0B29, 339\u2013341 (1980)","journal-title":"J. Combinatorial Theory Series"},{"issue":"7","key":"28_CR3","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1109\/12.256453","volume":"41","author":"M.A. Fiol","year":"1992","unstructured":"Fiol, M.A., Llado, A.S.: The partial line digraph technique in the design of large interconnection networks. IEEE Trans. on Computers\u00a041(7), 848\u2013857 (1992)","journal-title":"IEEE Trans. on Computers"},{"key":"28_CR4","first-page":"105","volume":"25C","author":"M.A. Fiol","year":"1988","unstructured":"Fiol, M.A., Llado, A.S., Villar, J.L.: Digraphs on alphabets and the (d,N) digraph problem. Ars Combinatoria\u00a025C, 105\u2013122 (1988)","journal-title":"Ars Combinatoria"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1109\/TC.1984.1676455","volume":"C-33","author":"M.A. Fiol","year":"1984","unstructured":"Fiol, M.A., Yebra, J.L.A., Alegre, I.: Line digraph iterations and the (d,k) digraph problem. IEEE Transactions on Computers\u00a0C-33, 400\u2013403 (1984)","journal-title":"IEEE Transactions on Computers"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1109\/TC.1981.1675809","volume":"C-30","author":"M. Imase","year":"1981","unstructured":"Imase, M., Itoh, M.: Design to minimize a diameter on building block network. IEEE Trans. on Computers\u00a0C-30, 439\u2013442 (1981)","journal-title":"IEEE Trans. on Computers"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1109\/TC.1983.1676323","volume":"C-32","author":"M. Imase","year":"1983","unstructured":"Imase, M., Itoh, M.: A design for directed graphs with minimum diameter. IEEE Trans. on Computers\u00a0C-32, 782\u2013784 (1983)","journal-title":"IEEE Trans. on Computers"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1093\/comjnl\/31.1.71","volume":"31","author":"M. Miller","year":"1988","unstructured":"Miller, M., Fris, I.: Minimum diameter of diregular digraphs of degree 2. Computer Journal\u00a031, 71\u201375 (1988)","journal-title":"Computer Journal"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-44968-X_19","volume-title":"Computing and Combinatorics","author":"M. Miller","year":"2000","unstructured":"Miller, M.: On the monotonicity of minimum diameter with respect to order and maximum out-degree. In: Du, D.-Z., Eades, P., Sharma, A.K., Lin, X., Estivill-Castro, V. (eds.) COCOON 2000. LNCS, vol.\u00a01858, pp. 193\u2013201. Springer, Heidelberg (2000)"},{"key":"28_CR10","unstructured":"Plesn\u00edk, J., Zn\u00e1m, \u0160.: Strongly geodetic directed graphs. In: Acta F. R. N. Univ. Comen. - Mathematica XXIX, pp. 29\u201334 (1974)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45278-9_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T18:36:33Z","timestamp":1558722993000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45278-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642452772","9783642452789"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45278-9_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}