{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T02:44:39Z","timestamp":1768531479441,"version":"3.49.0"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,9,16]],"date-time":"2020-09-16T00:00:00Z","timestamp":1600214400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,16]],"date-time":"2020-09-16T00:00:00Z","timestamp":1600214400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100005276","name":"National Board for Higher Mathematics","doi-asserted-by":"publisher","award":["2\/48(4)\/ 2016\/NBHM-R&D-II\/11580"],"award-info":[{"award-number":["2\/48(4)\/ 2016\/NBHM-R&D-II\/11580"]}],"id":[{"id":"10.13039\/501100005276","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004329","name":"Javna Agencija za Raziskovalno Dejavnost RS","doi-asserted-by":"publisher","award":["P1-0297"],"award-info":[{"award-number":["P1-0297"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s11227-020-03420-w","type":"journal-article","created":{"date-parts":[[2020,9,16]],"date-time":"2020-09-16T11:03:27Z","timestamp":1600254207000},"page":"4135-4150","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes"],"prefix":"10.1007","volume":"77","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1851-6334","authenticated-orcid":false,"given":"R.","family":"Sundara Rajan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Kalinowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandi","family":"Klav\u017ear","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamid","family":"Mokhtar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. M.","family":"Rajalaxmi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,16]]},"reference":[{"issue":"3","key":"3420_CR1","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1137\/0125042","volume":"25","author":"D Adolphson","year":"1973","unstructured":"Adolphson D, Hu TC (1973) Optimal linear ordering. SIAM J Appl Math 25(3):403\u2013423","journal-title":"SIAM J Appl Math"},{"issue":"1\u20133","key":"3420_CR2","doi-asserted-by":"crossref","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 (2000) The congestion of $$n$$-cube layout on a rectangular grid. Discrete Math 213(1\u20133):13\u201319","journal-title":"Discrete Math"},{"key":"3420_CR3","first-page":"693","volume-title":"Mathematical Foundations of Computer Science. Lecture Notes in Computer Science","author":"SL Bezrukov","year":"1998","unstructured":"Bezrukov SL, Chavez JD, Harper LH, R\u00f6ttger M, Schroeder UP (1998) Embedding of hypercubes into grids. In: Brim L, Gruska J, Zlatu\u0161ka J (eds) Mathematical Foundations of Computer Science. Lecture Notes in Computer Science, vol 1450. Springer, Berlin, pp 693\u2013701"},{"issue":"1\u20133","key":"3420_CR4","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/S0166-218X(98)00106-1","volume":"87","author":"L Bezrukov Sergei","year":"1998","unstructured":"Bezrukov Sergei L, Schroeder U-P (1998) The cyclic wirelength of trees. Discrete Appl Math 87(1\u20133):275\u2013277","journal-title":"Discrete Appl Math"},{"key":"3420_CR5","series-title":"Bolyai Society Mathematical Studies","first-page":"157","volume-title":"Graph theory and combinatorial biology","author":"SS Bezrukov","year":"1999","unstructured":"Bezrukov SS (1999) Edge isoperimetric problems on graphs. In: Lov\u00e1sz L (ed) Graph theory and combinatorial biology. Bolyai Society Mathematical Studies. J\u00e1nos Bolyai Mathematical Society, Budapest, pp 157\u2013197"},{"issue":"1","key":"3420_CR6","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s11227-014-1152-7","volume":"69","author":"A Bossard","year":"2014","unstructured":"Bossard A (2014) The decycling problem in hierarchical cubic networks. J Supercomput 69(1):293\u2013305","journal-title":"J Supercomput"},{"issue":"3","key":"3420_CR7","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/71.210815","volume":"4","author":"V Chaudhary","year":"1993","unstructured":"Chaudhary V, Aggarwal JK (1993) A generalized scheme for mapping parallel algorithms. IEEE Trans Parallel Distrib Syst 4(3):328\u2013346","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"1\u20133","key":"3420_CR8","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0166-218X(98)00098-5","volume":"87","author":"JD Chavez","year":"1998","unstructured":"Chavez JD, Trapp R (1998) The cyclic cutwidth of trees. Discrete Appl Math 87(1\u20133):25\u201332","journal-title":"Discrete Appl Math"},{"issue":"2","key":"3420_CR9","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1006\/jpdc.1995.1013","volume":"24","author":"W-K Chen","year":"1995","unstructured":"Chen W-K, Stallmann MF (1995) On embedding binary trees into hypercubes. J Parallel Distrib Comput 24(2):132\u2013138","journal-title":"J Parallel Distrib Comput"},{"key":"3420_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2018.03.011","volume":"728","author":"Q Cheng","year":"2018","unstructured":"Cheng Q, Li P, Xu M (2018) Conditional (edge-)fault-tolerant strong Menger (edge) connectivity of folded hypercubes. Theor Comput Sci 728:1\u20138","journal-title":"Theor Comput Sci"},{"issue":"2","key":"3420_CR11","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1002\/net.10033","volume":"40","author":"SA Choudum","year":"2002","unstructured":"Choudum SA, Sunitha V (2002) Augmented cubes. Networks 40(2):71\u201384","journal-title":"Networks"},{"issue":"4","key":"3420_CR12","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1016\/j.dam.2006.09.003","volume":"155","author":"T Dvo\u0159\u00e1k","year":"2007","unstructured":"Dvo\u0159\u00e1k T (2007) Dense sets and embedding binary trees into hypercubes. Discrete Appl Math 155(4):506\u2013514","journal-title":"Discrete Appl Math"},{"issue":"15","key":"3420_CR13","doi-asserted-by":"crossref","first-page":"3151","DOI":"10.1016\/j.ins.2006.12.010","volume":"177","author":"J Fan","year":"2007","unstructured":"Fan J, Jia X (2007) Embedding meshes into crossed cubes. Inf Sci 177(15):3151\u20133160","journal-title":"Inf Sci"},{"issue":"22","key":"3420_CR14","doi-asserted-by":"crossref","first-page":"3332","DOI":"10.1016\/j.ins.2006.01.001","volume":"176","author":"J Fan","year":"2006","unstructured":"Fan J, Jia X, Lin X (2006) Complete path embeddings in crossed cubes. Inf Sci 176(22):3332\u20133346","journal-title":"Inf Sci"},{"issue":"2","key":"3420_CR15","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1007\/s11227-018-2612-2","volume":"75","author":"W Fan","year":"2019","unstructured":"Fan W, Fan J, Lin C-K, Wang G, Cheng B, Wang R (2019) An efficient algorithm for embedding exchanged hypercubes into grids. J Supercomput 75(2):783\u2013807","journal-title":"J Supercomput"},{"issue":"2","key":"3420_CR16","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1007\/s11390-019-1893-0","volume":"34","author":"W Fan","year":"2019","unstructured":"Fan W, Fan J, Lin C-K, Wang Y, Han Y-J, Wang R (2019) Optimally embedding $$3$$-ary $$n$$-cubes into grids. J Comput Sci Technol 34(2):372\u2013387","journal-title":"J Comput Sci Technol"},{"issue":"1","key":"3420_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ipl.2005.05.026","volume":"96","author":"J-F Fang","year":"2005","unstructured":"Fang J-F, Lai K-C (2005) Embedding the incomplete hypercube in books. Inf Process Lett 96(1):1\u20136","journal-title":"Inf Process Lett"},{"issue":"3","key":"3420_CR18","doi-asserted-by":"crossref","first-page":"1235","DOI":"10.1007\/s11227-013-1078-5","volume":"68","author":"L Guo","year":"2013","unstructured":"Guo L, Guo X (2013) Fault tolerance of hypercubes and folded hypercubes. J Supercomput 68(3):1235\u20131240","journal-title":"J Supercomput"},{"issue":"19","key":"3420_CR19","doi-asserted-by":"crossref","first-page":"3794","DOI":"10.1016\/j.ins.2010.06.001","volume":"180","author":"Y Han","year":"2010","unstructured":"Han Y, Fan J, Zhang S, Yang J, Qian P (2010) Embedding meshes into locally twisted cubes. Inf Sci 180(19):3794\u20133805","journal-title":"Inf Sci"},{"issue":"1","key":"3420_CR20","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1137\/0112012","volume":"12","author":"LH Harper","year":"1964","unstructured":"Harper LH (1964) Optimal assignments of numbers to vertices. J Soc Ind Appl Math 12(1):131\u2013135","journal-title":"J Soc Ind Appl Math"},{"issue":"3","key":"3420_CR21","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1016\/S0021-9800(66)80059-5","volume":"1","author":"LH Harper","year":"1966","unstructured":"Harper LH (1966) Optimal numberings and isoperimetric problems on graphs. J Comb Theory 1(3):385\u2013393","journal-title":"J Comb Theory"},{"issue":"2","key":"3420_CR22","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0166-218X(89)90022-X","volume":"23","author":"M-C Heydemann","year":"1989","unstructured":"Heydemann M-C, Meyer JC, Sotteau D (1989) On forwarding indices of networks. Discrete Appl Math 23(2):103\u2013123","journal-title":"Discrete Appl Math"},{"issue":"5","key":"3420_CR23","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1080\/00029890.1964.11992272","volume":"71","author":"HL John II","year":"1964","unstructured":"John HL II (1964) Assignment of numbers to vertices. Am Math Mon 71(5):508","journal-title":"Am Math Mon"},{"key":"3420_CR24","doi-asserted-by":"crossref","DOI":"10.1201\/b10613","volume-title":"Topics in graph theory: graphs and their cartesian product","author":"W Imrich","year":"2008","unstructured":"Imrich W, Klav\u017ear S, Rall DF (2008) Topics in graph theory: graphs and their cartesian product. CRC Press, Boca Raton"},{"key":"3420_CR25","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.dam.2016.12.008","volume":"220","author":"C-N Kuo","year":"2017","unstructured":"Kuo C-N, Cheng Y-H (2017) Cycles embedding in folded hypercubes with conditionally faulty vertices. Discrete Appl Math 220:55\u201359","journal-title":"Discrete Appl Math"},{"issue":"2","key":"3420_CR26","doi-asserted-by":"crossref","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":"3420_CR27","volume-title":"Introduction to parallel algorithms and architectures: arrays, trees, hypercubes","author":"LF Thompson","year":"1992","unstructured":"Thompson LF (1992) Introduction to parallel algorithms and architectures: arrays, trees, hypercubes. Morgan Kaufmann Publishers, Burlington"},{"issue":"3","key":"3420_CR28","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1137\/0213040","volume":"13","author":"JY-T Leung","year":"1984","unstructured":"Leung JY-T, Vornberger O, Witthoff JD (1984) On some variants of the bandwidth minimization problem. SIAM J Comput 13(3):650\u2013667","journal-title":"SIAM J Comput"},{"issue":"2","key":"3420_CR29","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s11227-009-0297-2","volume":"53","author":"Y Li","year":"2010","unstructured":"Li Y, Peng S, Chu W (2010) Metacube\u2014a versatile family of interconnection networks for extremely large-scale supercomputers. J Supercomput 53(2):329\u2013351","journal-title":"J Supercomput"},{"key":"3420_CR30","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.tcs.2017.09.030","volume":"704","author":"A Liu","year":"2017","unstructured":"Liu A, Wang S, Yuan J, Li J (2017) On $$g$$-extra conditional diagnosability of hypercubes and folded hypercubes. Theor Comput Sci 704:62\u201373","journal-title":"Theor Comput Sci"},{"issue":"1","key":"3420_CR31","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.tcs.2019.04.028","volume":"790","author":"H Liu","year":"2019","unstructured":"Liu H, Zhang S, Li D (2019) On g-extra conditional diagnosability of hierarchical cubic networks. Theor Comput Sci 790(1):66\u201379","journal-title":"Theor Comput Sci"},{"issue":"2","key":"3420_CR32","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/s11227-009-0356-8","volume":"56","author":"Y Lu","year":"2009","unstructured":"Lu Y, Jun-Ming X (2009) Panconnectivity of Cartesian product graphs. J Supercomput 56(2):182\u2013189","journal-title":"J Supercomput"},{"issue":"7","key":"3420_CR33","doi-asserted-by":"crossref","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"},{"key":"3420_CR34","doi-asserted-by":"crossref","first-page":"1250004","DOI":"10.1142\/S0219265912500041","volume":"13","author":"P Manuel","year":"2012","unstructured":"Manuel P, Rajasingh I, Rajan RS (2012) Embedding variants of hypercubes with dilation 2. J Interconnect Netw 13:1250004","journal-title":"J Interconnect Netw"},{"key":"3420_CR35","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.dam.2014.11.024","volume":"185","author":"A Matsubayashi","year":"2015","unstructured":"Matsubayashi A (2015) Separator-based graph embedding into multidimensional grids with small edge-congestion. Discrete Appl Math 185:119\u2013137","journal-title":"Discrete Appl Math"},{"issue":"2","key":"3420_CR36","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1093\/comjnl\/bxu031","volume":"58","author":"M Miller","year":"2014","unstructured":"Miller M, Rajan RS, Parthiban N, Rajasingh I (2014) Minimum linear arrangement of incomplete hypercubes. Comput J 58(2):331\u2013337","journal-title":"Comput J"},{"issue":"3","key":"3420_CR37","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0166-218X(99)00161-4","volume":"98","author":"J Opatrn\u00fd","year":"2000","unstructured":"Opatrn\u00fd J, Sotteau D (2000) Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1. Discrete Appl Math 98(3):237\u2013254","journal-title":"Discrete Appl Math"},{"key":"3420_CR38","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/j.dam.2018.05.034","volume":"280","author":"RS Rajan","year":"2020","unstructured":"Rajan RS, Rajalaxmi TM, Liu J-B, Sethuraman G (2020) Wirelength of embedding complete multipartite graphs into certain graphs. Discrete Appl Math 280:221\u2013236","journal-title":"Discrete Appl Math"},{"issue":"1","key":"3420_CR39","doi-asserted-by":"crossref","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":"12","key":"3420_CR40","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/j.ipl.2012.03.006","volume":"112","author":"I Rajasingh","year":"2012","unstructured":"Rajasingh I, Rajan B, Sundara RR (2012) Embedding of hypercubes into necklace, windmill and snake graphs. Inf Process Lett 112(12):509\u2013515","journal-title":"Inf Process Lett"},{"issue":"15","key":"3420_CR41","doi-asserted-by":"crossref","first-page":"1970","DOI":"10.1080\/00207160.2012.697557","volume":"89","author":"I Rajasingh","year":"2012","unstructured":"Rajasingh I, Rajan B, Sundara RR (2012) Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs. Int J Comput Math 89(15):1970\u20131978","journal-title":"Int J Comput Math"},{"issue":"12","key":"3420_CR42","doi-asserted-by":"crossref","first-page":"1654","DOI":"10.1109\/12.9743","volume":"37","author":"P Ramanathan","year":"1988","unstructured":"Ramanathan P, Shin KG (1988) Reliable broadcast in hypercube multicomputers. IEEE Trans Comput 37(12):1654\u20131657","journal-title":"IEEE Trans Comput"},{"issue":"7","key":"3420_CR43","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1109\/12.2234","volume":"37","author":"Y Saad","year":"1988","unstructured":"Saad Y, Schultz MH (1988) Topological properties of hypercubes. IEEE Trans Comput 37(7):867\u2013872","journal-title":"IEEE Trans Comput"},{"key":"3420_CR44","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.06.039","author":"AJ Shalini","year":"2018","unstructured":"Shalini AJ, Abraham J, Arockiaraj M (2018) A linear time algorithm for embedding locally twisted cube into grid network to optimize the layout. Discrete Appl Math. https:\/\/doi.org\/10.1016\/j.dam.2018.06.039 (in press)","journal-title":"Discrete Appl Math"},{"issue":"7","key":"3420_CR45","doi-asserted-by":"crossref","first-page":"1721","DOI":"10.1080\/00207549308956819","volume":"31","author":"J Skorin-Kapov","year":"1993","unstructured":"Skorin-Kapov J, Vakharia AJ (1993) Scheduling a flow-line manufacturing cell: a tabu search approach. Int J Prod Res 31(7):1721\u20131734","journal-title":"Int J Prod Res"},{"issue":"1\u20133","key":"3420_CR46","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0166-218X(98)00009-2","volume":"84","author":"L Stacho","year":"1998","unstructured":"Stacho L, Vrt\u2019o I (1998) Bisection width of transposition graphs. Discrete Appl Math 84(1\u20133):221\u2013235","journal-title":"Discrete Appl Math"},{"issue":"1","key":"3420_CR47","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1021\/ja01193a005","volume":"69","author":"H Wiener","year":"1947","unstructured":"Wiener H (1947) Structural determination of paraffin boiling points. J Am Chem Soc 69(1):17\u201320","journal-title":"J Am Chem Soc"},{"issue":"3","key":"3420_CR48","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/0743-7315(85)90026-7","volume":"2","author":"AY Wu","year":"1985","unstructured":"Wu AY (1985) Embedding of tree networks into hypercubes. J Parallel Distrib Comput 2(3):238\u2013249","journal-title":"J Parallel Distrib Comput"},{"key":"3420_CR49","volume-title":"Topological structure and analysis of interconnection networks Network theory and applications","author":"J Xu","year":"2013","unstructured":"Xu J (2013) Topological structure and analysis of interconnection networks Network theory and applications, vol 7. Springer, Berlin"},{"key":"3420_CR50","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.ipl.2017.05.001","volume":"125","author":"W Yang","year":"2017","unstructured":"Yang W, Zhao S, Zhang S (2017) Strong Menger connectivity with conditional faults of folded hypercubes. Inf Process Lett 125:30\u201334","journal-title":"Inf Process Lett"},{"issue":"1","key":"3420_CR51","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/j.tcs.2016.01.046","volume":"626","author":"J Yuan","year":"2016","unstructured":"Yuan J, Liu A, Qin X, Zhang J, Li J (2016) g-good-neighbor conditional diagnosability measures for 3-ary $$n$$-cube networks. Theor Comput Sci 626(1):144\u2013162","journal-title":"Theor Comput Sci"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-020-03420-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-020-03420-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-020-03420-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,15]],"date-time":"2021-09-15T23:56:10Z","timestamp":1631750170000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-020-03420-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,16]]},"references-count":51,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["3420"],"URL":"https:\/\/doi.org\/10.1007\/s11227-020-03420-w","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,16]]},"assertion":[{"value":"16 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}