{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T08:42:29Z","timestamp":1648543349917},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T00:00:00Z","timestamp":1114905600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2005,5]]},"DOI":"10.1007\/s10878-005-1410-y","type":"journal-article","created":{"date-parts":[[2005,6,28]],"date-time":"2005-06-28T20:57:18Z","timestamp":1119992238000},"page":"263-266","source":"Crossref","is-referenced-by-count":2,"title":["On 3-Stage Clos Networks with Different Nonblocking Requirements on Two Types of Calls"],"prefix":"10.1007","volume":"9","author":[{"given":"Hung-Lin","family":"Fu","sequence":"first","affiliation":[]},{"given":"Frank K.","family":"Hwang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1410_CR1","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1002\/j.1538-7305.1953.tb01433.x","volume":"32","author":"C. Clos","year":"1953","unstructured":"C. Clos, \u201cA study of nonblocking switching networks,\u201d Bell Syst. Tech. J., vol. 32, pp. 406\u2013424, 1953.","journal-title":"Bell Syst. Tech. J."},{"key":"1410_CR2","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0895-7177(93)90253-U","volume":"17","author":"D.Z. Du","year":"1993","unstructured":"D.Z. Du, D.F. Hsu, and F.K. Hwang, \u201cThe hamiltonian property of consecutive-d digraphs,\u201d Mathl. Comput. Modelling, vol. 17, pp. 61\u201363, 1993.","journal-title":"Mathl. Comput. Modelling"},{"key":"1410_CR3","first-page":"65","volume":"6","author":"D.Z. Du","year":"2002","unstructured":"D.Z. Du and H.Q. Ngo, \u201cAn extension of DHH-Erd\u00f6s conjecture on cycle-plus-triangle graphs,\u201d Taiwan J. Math. vol. 6, pp. 65\u2013105, 2002.","journal-title":"Taiwan J. Math."},{"key":"1410_CR4","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0012-365X(92)90588-7","volume":"101","author":"H. Fleischner","year":"1992","unstructured":"H. Fleischner and M. Stiebitz, \u201cA solution to a coloring problem of P. Erd\u00f6s,\u201d Disc. Math., vol. 101, pp. 39\u201348, 1992.","journal-title":"Disc. Math."},{"key":"1410_CR5","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P. Hall","year":"1935","unstructured":"P. Hall, \u201cOn representatives of subsets,\u201d J. London Math. Soc., vol. 10, pp. 26\u201330, 1935.","journal-title":"J. London Math. Soc."},{"key":"1410_CR6","first-page":"261","volume":"6","author":"F.K. Hwang","year":"2002","unstructured":"F.K. Hwang, S.-C. Liaw, and L.D. Tong, \u201cStrictly nonbolcking 3-stage Clos networks with some rearrangeable multicast capability,\u201d IEEE Trans. Commun., vol. 6, pp. 261\u2013267, 2002.","journal-title":"IEEE Trans. Commun."},{"key":"1410_CR7","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1142\/S0218539395000228","volume":"2","author":"F.K. Hwang","year":"1995","unstructured":"F.K. Hwang and C.H. Lin, \u201cBroadcasting in a three-stage point-to-point nonblocking network,\u201d Inter. J. Rel. Qual. Safety Eng., vol. 2, pp. 299\u2013307, 1995.","journal-title":"Inter. J. Rel. Qual. Safety Eng."},{"key":"1410_CR8","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1137\/0606057","volume":"6","author":"D.G. Kirkpatrick","year":"1955","unstructured":"D.G. Kirkpatrick, M. Klawe, and N. Pippenger, \u201cSome graph-coloring theorems with applications to generalized connection networks,\u201d SIAM J. Alg. Disc. Methods, vol. 6, pp. 576\u2013582, 1955.","journal-title":"SIAM J. Alg. Disc. Methods"},{"key":"1410_CR9","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1002\/net.3230020303","volume":"2","author":"G.M. Masson","year":"1972","unstructured":"G.M. Masson and B.W. Jordan, \u201cGeneralized multi-stage connection networks,\u201d Networks, vol. 2, pp. 191\u2013209, 1972.","journal-title":"Networks"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-1410-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-005-1410-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-1410-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:08Z","timestamp":1559276288000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-005-1410-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,5]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,5]]}},"alternative-id":["1410"],"URL":"https:\/\/doi.org\/10.1007\/s10878-005-1410-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,5]]}}}