{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T15:15:32Z","timestamp":1648566932255},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,5,12]],"date-time":"2011-05-12T00:00:00Z","timestamp":1305158400000},"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":[[2012,11]]},"DOI":"10.1007\/s10878-011-9402-6","type":"journal-article","created":{"date-parts":[[2011,5,11]],"date-time":"2011-05-11T12:28:14Z","timestamp":1305116894000},"page":"468-484","source":"Crossref","is-referenced-by-count":0,"title":["Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors"],"prefix":"10.1007","volume":"24","author":[{"given":"Yang","family":"Wang","sequence":"first","affiliation":[]},{"given":"Hung Q.","family":"Ngo","sequence":"additional","affiliation":[]},{"given":"Thanh-Nhan","family":"Nguyen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,5,12]]},"reference":[{"issue":"1","key":"9402_CR1","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/S0022-0000(05)80027-3","volume":"48","author":"N Alon","year":"1994","unstructured":"Alon N, Pudl\u00e1k P (1994) Superconcentrators of depths 2 and 3; odd levels help (rarely). J Comput Syst Sci 48(1):194\u2013202","journal-title":"J Comput Syst Sci"},{"issue":"3","key":"9402_CR2","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1137\/S0097539791221499","volume":"25","author":"S Arora","year":"1996","unstructured":"Arora S, Leighton FT, Maggs BM (1996) On-line algorithms for path selection in a nonblocking network. SIAM J Comput 25(3):600\u2013625","journal-title":"SIAM J Comput"},{"issue":"4","key":"9402_CR3","doi-asserted-by":"crossref","first-page":"726","DOI":"10.1137\/0220046","volume":"20","author":"SP Chung","year":"1991","unstructured":"Chung SP, Ross KW (1991) On nonblocking multirate interconnection networks. SIAM J Comput 20(4):726\u2013736","journal-title":"SIAM J Comput"},{"key":"9402_CR4","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1002\/j.1538-7305.1953.tb01433.x","volume":"32","author":"C Clos","year":"1953","unstructured":"Clos C (1953) A study of non-blocking switching networks. Bell Syst Tech J 32:406\u2013424","journal-title":"Bell Syst Tech J"},{"issue":"5","key":"9402_CR5","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1109\/90.251915","volume":"1","author":"P Coppo","year":"1993","unstructured":"Coppo P, D\u2019Ambrosio M, Melen R (1993) Optimal cost\/performance design of ATM switches. IEEE\/ACM Trans Netw 1(5):566\u2013575","journal-title":"IEEE\/ACM Trans Netw"},{"key":"9402_CR6","first-page":"398","volume-title":"Proceedings of the 36th annual ACM symposium on theory of computing","author":"JR Correa","year":"2004","unstructured":"Correa JR, Goemans MX (2004) An approximate K\u00f6nig\u2019s theorem for edge-coloring weighted bipartite graphs. In: Proceedings of the 36th annual ACM symposium on theory of computing. ACM, New York, pp\u00a0398\u2013406 (electronic)"},{"key":"9402_CR7","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1145\/800061.808731","volume-title":"Proceedings of the fifteenth annual ACM symposium on theory of computing","author":"D Dolev","year":"1983","unstructured":"Dolev D, Dwork C, Pippenger N, Wigderson A (1983) Superconcentrators, generalizers and generalized connectors with limited depth (preliminary version). In: Proceedings of the fifteenth annual ACM symposium on theory of computing, Boston, Massachusetts, pp 42\u201351"},{"issue":"2","key":"9402_CR8","first-page":"464","volume":"28","author":"DZ Du","year":"1999","unstructured":"Du DZ, Gao B, Hwang FK, Kim JH (1999) On multirate rearrangeable Clos networks. SIAM J Comput 28(2):464\u2013471 (electronic)","journal-title":"SIAM J Comput"},{"issue":"2","key":"9402_CR9","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1006\/jagm.1997.0866","volume":"24","author":"JA Fingerhut","year":"1997","unstructured":"Fingerhut JA, Suri S, Turner JS (1997) Designing least-cost nonblocking broadband networks. J Algorithms 24(2):287\u2013309","journal-title":"J Algorithms"},{"issue":"4","key":"9402_CR10","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1090\/S0273-0979-06-01126-8","volume":"43","author":"S Hoory","year":"2006","unstructured":"Hoory S, Linial N, Wigderson A (2006) Expander graphs and their applications. Bull New Ser Am Math Soc 43(4):439\u2013561 (electronic)","journal-title":"Bull New Ser Am Math Soc"},{"issue":"9","key":"9402_CR11","doi-asserted-by":"crossref","first-page":"1382","DOI":"10.1006\/jpdc.2001.1755","volume":"61","author":"XD Hu","year":"2001","unstructured":"Hu XD, Jia XH, Du DZ, Hwang FK (2001) Monotone routing in multirate rearrangeable Clos networks. J\u00a0Parallel Distrib Comput 61(9):1382\u20131388","journal-title":"J\u00a0Parallel Distrib Comput"},{"key":"9402_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3264-4","volume-title":"Switching and traffic theory for integrated broadband networks","author":"JH Hui","year":"1990","unstructured":"Hui JH (1990) Switching and traffic theory for integrated broadband networks. Kluwer Academic, Dordrecht"},{"key":"9402_CR13","doi-asserted-by":"crossref","DOI":"10.1142\/3640","volume-title":"The mathematical theory of nonblocking switching networks","author":"FK Hwang","year":"1998","unstructured":"Hwang FK (1998) The mathematical theory of nonblocking switching networks. World Scientific, River Edge"},{"issue":"2","key":"9402_CR14","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1137\/0405020","volume":"5","author":"RM Karp","year":"1992","unstructured":"Karp RM (1992) Three-stage generalized connectors. SIAM J Discrete Math 5(2):259\u2013272","journal-title":"SIAM J Discrete Math"},{"issue":"2","key":"9402_CR15","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0304-3975(00)00142-0","volume":"261","author":"DS Kim","year":"2001","unstructured":"Kim DS, Du DZ (2001) Multirate multicast switching networks. Theor Comput Sci 261(2):241\u2013251. Computing and combinatorics (Taipei, 1998)","journal-title":"Theor Comput Sci"},{"issue":"3","key":"9402_CR16","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1109\/90.700894","volume":"6","author":"SC Liew","year":"1998","unstructured":"Liew SC, Ng MH, Chan CW (1998) Blocking and nonblocking multirate Clos switching networks. IEEE\/ACM Trans Netw 6(3):307\u2013318","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"4","key":"9402_CR17","doi-asserted-by":"crossref","first-page":"1225","DOI":"10.1137\/S0097539796313921","volume":"28","author":"GH Lin","year":"1999","unstructured":"Lin GH, Du DZ, Hu XD, Xue G (1999) On rearrangeability of multirate Clos networks. SIAM J Comput 28(4):1225\u20131231 (electronic)","journal-title":"SIAM J Comput"},{"issue":"2","key":"9402_CR18","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1137\/0218021","volume":"18","author":"R Melen","year":"1989","unstructured":"Melen R, Turner JS (1989) Nonblocking multirate networks. SIAM J Comput 18(2):301\u2013313","journal-title":"SIAM J Comput"},{"key":"9402_CR19","first-page":"1234","volume-title":"INFOCOM","author":"R Melen","year":"1990","unstructured":"Melen R, Turner JS (1990) Nonblocking multirate distribution networks. In: INFOCOM, pp 1234\u20131241"},{"issue":"2","key":"9402_CR20","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1109\/26.216511","volume":"41","author":"R Melen","year":"1993","unstructured":"Melen R, Turner JS (1993) Nonblocking multirate distribution networks. IEEE Trans Commun 41(2):362\u2013369","journal-title":"IEEE Trans Commun"},{"issue":"3","key":"9402_CR21","doi-asserted-by":"crossref","first-page":"2157","DOI":"10.1016\/S0304-3975(02)00579-0","volume":"290","author":"HQ Ngo","year":"2003","unstructured":"Ngo HQ (2003) A new routing algorithm for multirate rearrangeable Clos networks. Theor Comput Sci 290(3):2157\u20132167","journal-title":"Theor Comput Sci"},{"key":"9402_CR22","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1109\/HPSR.2004.1303462","volume-title":"Proceedings of the workshop on high performance switching and routing (HPSR)","author":"HQ Ngo","year":"2004","unstructured":"Ngo HQ (2004) Multiwavelength distribution networks. In: Proceedings of the workshop on high performance switching and routing (HPSR). IEEE, Phoenix, pp 186\u2013190"},{"key":"9402_CR23","series-title":"Network theory and applications","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/978-1-4613-0281-0_14","volume-title":"Advances in switching networks","author":"HQ Ngo","year":"2001","unstructured":"Ngo HQ, Du DZ (2001) Notes on the complexity of switching networks. In: Du, DZ, Ngo, HQ (eds) Advances in switching networks. Network theory and applications, vol 5. Kluwer Academic, Dordrecht, pp 307\u2013367"},{"issue":"4","key":"9402_CR24","doi-asserted-by":"crossref","first-page":"1040","DOI":"10.1137\/S0097539702408235","volume":"32","author":"HQ Ngo","year":"2003","unstructured":"Ngo HQ, Vu VH (2003) Multirate rearrangeable Clos networks and a generalized bipartite graph edge coloring problem. SIAM J Comput 32(4):1040\u20131049","journal-title":"SIAM J Comput"},{"key":"9402_CR25","doi-asserted-by":"crossref","first-page":"990","DOI":"10.1109\/TNET.2008.2001728","volume":"17","author":"HQ Ngo","year":"2009","unstructured":"Ngo HQ, Wang Y, Pan D (2009) Rearrangeable and nonblocking [w,f]-distributors. IEEE\/ACM Trans Netw 17:990\u20131001. doi: 10.1109\/TNET.2008.2001728","journal-title":"IEEE\/ACM Trans Netw"},{"key":"9402_CR26","first-page":"449","volume-title":"Proceedings of the 5th ITC seminar on traffic engineering for ISDN design and planning","author":"G Niestegge","year":"1987","unstructured":"Niestegge G (1987) Nonblocking multirate switching networks. In: Proceedings of the 5th ITC seminar on traffic engineering for ISDN design and planning, pp 449\u2013458"},{"key":"9402_CR27","first-page":"186","volume":"14","author":"JP Ofman","year":"1965","unstructured":"Ofman JP (1965) A universal automaton. Tr Mosk Mat Ob\u015d 14:186\u2013199","journal-title":"Tr Mosk Mat Ob\u015d"},{"key":"9402_CR28","unstructured":"Pippenger N (1973) The complexity of switching networks. PhD thesis, Department of Electrical Engineering, Massachusetts Institute of Technology, Cambridge, Massachusetts"},{"issue":"4","key":"9402_CR29","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1137\/0207040","volume":"7","author":"N Pippenger","year":"1978","unstructured":"Pippenger N (1978) Generalized connectors. SIAM J Comput 7(4):510\u2013514","journal-title":"SIAM J Comput"},{"issue":"2","key":"9402_CR30","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF01215351","volume":"14","author":"P Pudl\u00e1k","year":"1994","unstructured":"Pudl\u00e1k P (1994) Communication in bounded depth circuits. Combinatorica 14(2):203\u2013216","journal-title":"Combinatorica"},{"issue":"1","key":"9402_CR31","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1137\/S0895480197329508","volume":"13","author":"J Radhakrishnan","year":"2000","unstructured":"Radhakrishnan J, Ta-Shma A (2000) Bounds for dispersers, extractors, and depth-two superconcentrators. SIAM J Discrete Math 13(1):2\u201324 (electronic)","journal-title":"SIAM J Discrete Math"},{"issue":"10","key":"9402_CR32","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1109\/MCOM.2003.1235593","volume":"41","author":"JS Turner","year":"2003","unstructured":"Turner JS, Melen R (2003) Multirate Clos networks. IEEE Commun Mag 41(10):38\u201344","journal-title":"IEEE Commun Mag"},{"issue":"2","key":"9402_CR33","first-page":"120","volume":"E81-B","author":"JS Turner","year":"1998","unstructured":"Turner JS, Yamanaka N (1998) Architectural choices in large scale ATM switches. IEICE Trans Commun E81-B(2):120\u2013137","journal-title":"IEICE Trans Commun"},{"key":"9402_CR34","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1145\/800116.803752","volume-title":"Seventh annual ACM symposium on theory of computing","author":"LG Valiant","year":"1975","unstructured":"Valiant LG (1975) On non-linear lower bounds in computational complexity. In: Seventh annual ACM symposium on theory of computing, Albuquerque, NM, 1975. Assoc Comput Mach, New York, pp\u00a045\u201353"},{"issue":"3","key":"9402_CR35","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/S0022-0000(76)80041-4","volume":"13","author":"LG Valiant","year":"1976","unstructured":"Valiant LG (1976) Graph-theoretic properties in computational complexity. J Comput Syst Sci 13(3):278\u2013285. Working papers presented at the ACM-SIGACT symposium on the theory of computing (Albuquerque, NM, 1975)","journal-title":"J Comput Syst Sci"},{"key":"9402_CR36","volume-title":"Proceedings of the workshop on high performance switching and routing (HPSR)","author":"Y Wang","year":"2007","unstructured":"Wang Y, Ngo HQ, Nguyen TN (2007) Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors. In: Proceedings of the workshop on high performance switching and routing (HPSR). IEEE Press, New York"},{"key":"9402_CR37","volume-title":"Introduction to graph theory","author":"DB West","year":"1996","unstructured":"West DB (1996) Introduction to graph theory. Prentice Hall, Upper Saddle River"},{"key":"9402_CR38","first-page":"256","volume-title":"International conference on supercomputing","author":"Y Yang","year":"1994","unstructured":"Yang Y (1994) An analysis model on nonblocking multirate broadcast networks. In: International conference on supercomputing, pp 256\u2013263"},{"issue":"5","key":"9402_CR39","doi-asserted-by":"crossref","first-page":"1466","DOI":"10.1109\/18.532886","volume":"42","author":"A Yavuz Oruc","year":"1996","unstructured":"Yavuz Oruc A, Huang H (1996) Crosspoint complexity of sparse crossbar concentrators. IEEE Trans Inf Theory 42(5):1466\u20131471","journal-title":"IEEE Trans Inf Theory"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9402-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-011-9402-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9402-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:15Z","timestamp":1559262195000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9402-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,12]]},"references-count":39,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,11]]}},"alternative-id":["9402"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9402-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,12]]}}}