{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:44:12Z","timestamp":1777596252609,"version":"3.51.4"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,8,10]],"date-time":"2019-08-10T00:00:00Z","timestamp":1565395200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,10]],"date-time":"2019-08-10T00:00:00Z","timestamp":1565395200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Loyola College - Times of India","award":["5LCTOI14MAT002"],"award-info":[{"award-number":["5LCTOI14MAT002"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s10878-019-00443-9","type":"journal-article","created":{"date-parts":[[2019,8,10]],"date-time":"2019-08-10T06:02:42Z","timestamp":1565416962000},"page":"1180-1195","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Node set optimization problem for complete Josephus cubes"],"prefix":"10.1007","volume":"38","author":[{"given":"Micheal","family":"Arockiaraj","sequence":"first","affiliation":[]},{"given":"Jessie","family":"Abraham","sequence":"additional","affiliation":[]},{"given":"Arul Jeya","family":"Shalini","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,10]]},"reference":[{"issue":"1","key":"443_CR1","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1137\/0206002","volume":"6","author":"AD Adolphson","year":"1977","unstructured":"Adolphson AD (1977) Single machine job sequencing with precedence constraints. SIAM J Comput 6(1):40\u201354","journal-title":"SIAM J Comput"},{"key":"443_CR2","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1016\/j.ipl.2011.06.011","volume":"111","author":"M Arockiaraj","year":"2011","unstructured":"Arockiaraj M, Manuel P, Rajasingh I, Rajan B (2011) Wirelength of $$1$$-fault hamiltonian graphs into wheels and fans. Inf Process Lett 111:921\u2013925","journal-title":"Inf Process Lett"},{"key":"443_CR3","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1080\/00207160.2015.1088943","volume":"94","author":"M Arockiaraj","year":"2015","unstructured":"Arockiaraj M, Abraham J, Quadras J, Shalini AJ (2015a) Linear layout of locally twisted cubes. Int J Comput Math 94:56\u201365. \n                    https:\/\/doi.org\/10.1080\/00207160.2015.1088943","journal-title":"Int J Comput Math"},{"key":"443_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.disopt.2015.03.001","volume":"17","author":"M Arockiaraj","year":"2015","unstructured":"Arockiaraj M, Quadras J, Rajasingh I, Shalini AJ (2015b) Embedding hypercubes and folded hypercubes onto cartesian product of certain trees. Discrete Optim 17:1\u201313","journal-title":"Discrete Optim"},{"issue":"2","key":"443_CR5","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1049\/iet-cdt.2018.5100","volume":"13","author":"M Arockiaraj","year":"2019","unstructured":"Arockiaraj M, Liu J-B, Shalini AJ (2019) Vertex decomposition methodfor wirelength problem and its applications to enhanced hypercube networks. IET Comput Digit Tec 13(2):87\u201392","journal-title":"IET Comput Digit Tec"},{"key":"443_CR6","doi-asserted-by":"crossref","unstructured":"Bezrukov SL, Chavez JD, Harper LH, R\u00f6ttger M, Schroeder U-P (1998) Embedding of hypercubes into grids. In: Proceedings of the 23rd international symposium on mathematical foundations of computer science. Springer, pp 693\u2013701","DOI":"10.1007\/BFb0055820"},{"issue":"1","key":"443_CR7","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0012-365X(99)00162-4","volume":"213","author":"SL Bezrukov","year":"2000","unstructured":"Bezrukov SL, Chavez JD, Harper LH, R\u00f6ttger M, Schroeder U-P (2000a) The congestion of $$n$$-cube layout on a rectangular grid. Discrete Math 213(1):13\u201319","journal-title":"Discrete Math"},{"issue":"2","key":"443_CR8","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s000260050003","volume":"4","author":"SL Bezrukov","year":"2000","unstructured":"Bezrukov SL, Das SK, Els\u00e4sser R (2000b) An edge-isoperimetric problem for powers of the Petersen graph. Ann Comb 4(2):153\u2013169","journal-title":"Ann Comb"},{"issue":"3","key":"443_CR9","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF01204731","volume":"8","author":"AJ Boals","year":"1994","unstructured":"Boals AJ, Gupta AK, Sherwani NA (1994) Incomplete hypercubes: algorithms and embeddings. J Supercomput 8(3):263\u2013294","journal-title":"J Supercomput"},{"issue":"1","key":"443_CR10","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/320434.320440","volume":"1","author":"PPS Chen","year":"1976","unstructured":"Chen PPS (1976) The entity-relationship model-toward a unified view of data. ACM Trans Database Syst 1(1):9\u201336","journal-title":"ACM Trans Database Syst"},{"issue":"11","key":"443_CR11","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1109\/71.642951","volume":"8","author":"H-L Chen","year":"1997","unstructured":"Chen H-L, Tzeng N-F (1997) A boolean expression-based approach for maximum incomplete subcube identification in faulty hypercubes. IEEE Trans Parallel Distrib Syst 8(11):1171\u20131183","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"443_CR12","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms. MIT Press and McGraw-Hill, New York"},{"issue":"3","key":"443_CR13","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/568522.568523","volume":"34","author":"J Diaz","year":"2002","unstructured":"Diaz J, Petit J, Serna M (2002) A survey of graph layout problems. Comput Surv 34(3):313\u201356","journal-title":"Comput Surv"},{"key":"443_CR14","volume-title":"Structured systems analysis: tools and techniques","author":"C Gane","year":"1977","unstructured":"Gane C, Sarson T (1977) Structured systems analysis: tools and techniques, 1st edn. McDonnell Douglas Systems Integration Company, Plano","edition":"1"},{"issue":"1","key":"443_CR15","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/0112012","volume":"12","author":"LH Harper","year":"1964","unstructured":"Harper LH (1964) Optimal assignments of numbers to vertices. SIAM J Appl Math 12(1):131\u2013135","journal-title":"SIAM J Appl Math"},{"key":"443_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511616679","volume-title":"Global methods for combinatorial isoperimetric problems","author":"LH Harper","year":"2004","unstructured":"Harper LH (2004) Global methods for combinatorial isoperimetric problems. Cambridge University Press, Cambridge"},{"key":"443_CR17","doi-asserted-by":"crossref","unstructured":"Karp RM (1993) Mapping the genome: some combinatorial problems arising in molecular biology. In: Proceedings of the twenty-fifth annual ACM symposium on theory of computing, New York, NY, USA, pp 278\u2013285","DOI":"10.1145\/167088.167170"},{"issue":"2","key":"443_CR18","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1002\/(SICI)1097-0118(199906)31:2<75::AID-JGT1>3.0.CO;2-S","volume":"31","author":"Y-L Lai","year":"1999","unstructured":"Lai Y-L, Williams K (1999) A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs. J Graph Theory 31(2):75\u201394","journal-title":"J Graph Theory"},{"key":"443_CR19","unstructured":"Loh PKK, Hsu WJ (1998) The Josephus cube: a large family of hypercubic interconnection networks. In: Proceedings of the 2nd international conference on parallel and distributed computing and networks, Brisbane, Australia, pp 176\u2013181"},{"issue":"4","key":"443_CR20","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/S0167-8191(99)00111-8","volume":"26","author":"PKK Loh","year":"2000","unstructured":"Loh PKK, Hsu WJ (2000) The Josephus cube: a novel interconnection network. Parallel Comput 26(4):427\u2013453","journal-title":"Parallel Comput"},{"issue":"1","key":"443_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S1383-7621(03)00039-0","volume":"49","author":"PKK Loh","year":"2003","unstructured":"Loh PKK, Hsu WJ (2003) Fault-tolerance of complete Josephus cubes. J Syst Archit 49(1):1\u201321","journal-title":"J Syst Archit"},{"issue":"9\u201310","key":"443_CR22","doi-asserted-by":"publisher","first-page":"1151","DOI":"10.1016\/j.parco.2004.07.003","volume":"30","author":"PKK Loh","year":"2004","unstructured":"Loh PKK, Hsu WJ (2004) Fault-tolerant routing for complete Josephus cubes. Parallel Comput 30(9\u201310):1151\u20131167","journal-title":"Parallel Comput"},{"issue":"4","key":"443_CR23","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1109\/50.285368","volume":"12","author":"A Louri","year":"1994","unstructured":"Louri A, Sung H (1994) An optical multi-mesh hypercube: a scalable optical interconnection network for massively parallel computing. J Lightw Technol 12(4):70\u2013716","journal-title":"J Lightw Technol"},{"issue":"5","key":"443_CR24","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1109\/71.679219","volume":"9","author":"A Louri","year":"1998","unstructured":"Louri A, Weech B, Neocleous C (1998) A spanning multichannel linked hypercube: a gradually scalable optical interconnection network for massively parallel computing. IEEE Trans Parallel Distrib Syst 9(5):497\u2013512","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"443_CR25","first-page":"220","volume-title":"Lecture Notes in Computer Science","author":"Lishan Lu","year":"2013","unstructured":"Lu L, Zhou S (2013) Conditional diagnosability of complete Josephus cubes. In: Network and parallel computing, lecture notes in computer science. Springer, Berlin, pp 220\u2013231"},{"key":"443_CR26","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.dam.2010.12.001","volume":"159","author":"P Manuel","year":"2011","unstructured":"Manuel P (2011) Minimum average congestion of enhanced and augmented hypercubes into complete binary trees. Discrete Appl Math 159:360\u2013366","journal-title":"Discrete Appl Math"},{"issue":"7","key":"443_CR27","doi-asserted-by":"publisher","first-page":"1486","DOI":"10.1016\/j.dam.2008.09.013","volume":"157","author":"P Manuel","year":"2009","unstructured":"Manuel P, Rajasingh I, Rajan B, Mercy H (2009) Exact wirelength of hypercubes on a grid. Discrete Appl Math 157(7):1486\u20131495","journal-title":"Discrete Appl Math"},{"issue":"17","key":"443_CR28","doi-asserted-by":"publisher","first-page":"2109","DOI":"10.1016\/j.dam.2011.07.003","volume":"159","author":"P Manuel","year":"2011","unstructured":"Manuel P, Arockiaraj M, Rajasingh I, Rajan B (2011) Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength. Discrete Appl Math 159(17):2109\u20132116","journal-title":"Discrete Appl Math"},{"issue":"4","key":"443_CR29","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1137\/0607063","volume":"7","author":"G Mitchison","year":"1986","unstructured":"Mitchison G, Durbin R (1986) Optimal numberings of an $$n \\times n$$ array. SIAM J Discrete Math 7(4):571\u2013582","journal-title":"SIAM J Discrete Math"},{"issue":"2","key":"443_CR30","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s10878-013-9604-1","volume":"29","author":"EG Pardo","year":"2015","unstructured":"Pardo EG, Soto M, Thraves C (2015) Embedding signed graphs in the line. J Comb Optim 29(2):451\u2013471","journal-title":"J Comb Optim"},{"issue":"2","key":"443_CR31","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s11786-015-0223-3","volume":"9","author":"J Quadras","year":"2015","unstructured":"Quadras J, Solomon SS (2015) Embedding of the folded hypercubes into tori. Math Comput Sci 9(2):177\u2013183","journal-title":"Math Comput Sci"},{"issue":"1","key":"443_CR32","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s11786-011-0085-2","volume":"5","author":"I Rajasingh","year":"2011","unstructured":"Rajasingh I, Arockiaraj M (2011) Linear wirelength of folded hypercubes. Math Comput Sci 5(1):101\u2013111","journal-title":"Math Comput Sci"},{"issue":"14\u201315","key":"443_CR33","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/j.ipl.2012.04.008","volume":"112","author":"I Rajasingh","year":"2012","unstructured":"Rajasingh I, Arockiaraj M, Rajan B, Manuel P (2012a) Minimum wirelength of hypercubes into $$n$$-dimensional grid networks. Inf Process Lett 112(14\u201315):583\u2013586","journal-title":"Inf Process Lett"},{"key":"443_CR34","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/j.ipl.2012.03.006","volume":"112","author":"I Rajasingh","year":"2012","unstructured":"Rajasingh I, Rajan B, Rajan RS (2012b) Embedding of hypercubes into necklace, windmill and snake graphs. Inf Process Lett 112:509\u2013515","journal-title":"Inf Process Lett"},{"issue":"1","key":"443_CR35","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10878-011-9443-x","volume":"26","author":"I Rajasingh","year":"2013","unstructured":"Rajasingh I, Manuel P, Arockiaraj M, Rajan B (2013) Embedding of circulant networks. J Comb Optim 26(1):135\u2013151","journal-title":"J Comb Optim"},{"key":"443_CR36","doi-asserted-by":"crossref","unstructured":"Ravi R, Agrawal A, Klein P (1991) Ordering problems approximated: single-processor scheduling and interval graphs connection. In: Proceedings of the 18th international colloquium on automata. Languages and programming. Springer, New York, pp 751\u2013762","DOI":"10.1007\/3-540-54233-7_180"},{"issue":"3","key":"443_CR37","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/12.76405","volume":"40","author":"NF Tzeng","year":"1991","unstructured":"Tzeng NF, Wei S (1991) Enhanced hypercubes. IEEE Trans Comput 40(3):284\u2013294","journal-title":"IEEE Trans Comput"},{"key":"443_CR38","unstructured":"Vannelli A, Rowan GS (1986) An eigen vector based approach for multistack VLSI layout. In: Proceedings of 29th midwest symposium on circuits and systems, North-Holland, New York, pp 435\u2013439"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00443-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-019-00443-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-019-00443-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,8]],"date-time":"2020-08-08T23:22:10Z","timestamp":1596928930000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-019-00443-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,10]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["443"],"URL":"https:\/\/doi.org\/10.1007\/s10878-019-00443-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,10]]},"assertion":[{"value":"10 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}