乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,2]],"date-time":"2024-08-02T01:32:50Z","timestamp":1722562370921},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2023,3,6]],"date-time":"2023-03-06T00:00:00Z","timestamp":1678060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,6]],"date-time":"2023-03-06T00:00:00Z","timestamp":1678060800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s11227-023-05140-3","type":"journal-article","created":{"date-parts":[[2023,3,6]],"date-time":"2023-03-06T14:03:48Z","timestamp":1678111428000},"page":"12000-12012","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["MinLA of $$(K_9-C_9)^n$$ and its optimal layout into certain trees"],"prefix":"10.1007","volume":"79","author":[{"given":"Syeda","family":"Afiya","sequence":"first","affiliation":[]},{"given":"M","family":"Rajesh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,6]]},"reference":[{"key":"5140_CR1","first-page":"157","volume":"7","author":"L Bezrukov Sergei","year":"1999","unstructured":"Bezrukov Sergei L (1999) Edge isoperimetric problems on graphs. Graph Theory Comb Biol 7:157\u2013197","journal-title":"Graph Theory Comb Biol"},{"key":"5140_CR2","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. J Soc Ind Appl Math 12:131\u2013135. https:\/\/doi.org\/10.1137\/0112012","journal-title":"J Soc Ind Appl Math"},{"key":"5140_CR3","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0166-218x(95)00078-6","volume":"69","author":"Lim Hyeong Seok","year":"1996","unstructured":"Seok Lim Hyeong, Heum Park Jung, Yong Chwa Kyung (1996) Embedding trees in recursive circulants. Discret Appl Math 69:83\u201399. https:\/\/doi.org\/10.1016\/0166-218x(95)00078-6","journal-title":"Discret Appl Math"},{"key":"5140_CR4","doi-asserted-by":"publisher","first-page":"1190","DOI":"10.1109\/TPDS.2005.151","volume":"16","author":"Fan Jianxi","year":"2005","unstructured":"Jianxi Fan, Xiaola Lin, Xiaohua Jia (2005) Optimal path embedding in crossed cubes. IEEE Trans Parallel Distrib Syst 16:1190\u20131200. https:\/\/doi.org\/10.1109\/TPDS.2005.151","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"5140_CR5","doi-asserted-by":"publisher","first-page":"1486","DOI":"10.1016\/j.dam.2008.09.013","volume":"15","author":"Manuel Paul","year":"2009","unstructured":"Paul Manuel, Indra Rajasingh, Bharati Rajan, Helda Mercy (2009) Exact wirelength of hypercubes on a grid. Discret Appl Math 15:1486\u20131495. https:\/\/doi.org\/10.1016\/j.dam.2008.09.013","journal-title":"Discret Appl Math"},{"key":"5140_CR6","doi-asserted-by":"publisher","first-page":"2150087","DOI":"10.1142\/s1793830921500877","volume":"14","author":"G Kirithiga-Nandini","year":"2022","unstructured":"Kirithiga-Nandini G, Sundara RR, Rajalaxmi TM, Shantrinal AA, Husain SKS, Hasni R (2022) Wiener index via wirelength of an embedding. Discret Math Algorithms Appl 14:2150087. https:\/\/doi.org\/10.1142\/s1793830921500877","journal-title":"Discret Math Algorithms Appl"},{"key":"5140_CR7","doi-asserted-by":"publisher","first-page":"367","DOI":"10.7155\/jgaa.00562","volume":"25","author":"AA Shantrinal","year":"2021","unstructured":"Shantrinal AA, Klavzar S, Rajalaxmi TM, Rajan RS (2021) An algorithm for embedding Tur\u00e1n graphs into incomplete hypercubes with minimum wirelength. J Graph Algorithms Appl 25:367\u2013381. https:\/\/doi.org\/10.7155\/jgaa.00562","journal-title":"J Graph Algorithms Appl"},{"key":"5140_CR8","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1007\/s11227-018-2612-2","volume":"75","author":"Fan Weibei","year":"2019","unstructured":"Weibei Fan, Jianxi Fan, Cheng-Kuan Lin, Guijuan Wan, Baolei Cheng, Ruchuan Wang (2019) An efficient algorithm for embedding exchanged hypercubes into grids. J Supercomput 75:783\u2013807. https:\/\/doi.org\/10.1007\/s11227-018-2612-2","journal-title":"J Supercomput"},{"key":"5140_CR9","doi-asserted-by":"publisher","first-page":"884","DOI":"10.1007\/s11227-021-03895-1","volume":"78","author":"F Keshavarz-Kohjerdi","year":"2022","unstructured":"Keshavarz-Kohjerdi F (2022) Embedding linear arrays of the maximum length in O-shaped meshes. J Supercomput 78:884\u2013918. https:\/\/doi.org\/10.1007\/s11227-021-03895-1","journal-title":"J Supercomput"},{"key":"5140_CR10","doi-asserted-by":"publisher","first-page":"4135","DOI":"10.1007\/s11227-020-03420-w","volume":"77","author":"R Sundara Rajan","year":"2021","unstructured":"Sundara Rajan R, Thomas Kalinowski, Sandi Klav\u017ear, Hamid Mokhtar, Rajalaxmi TM (2021) Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes. J Supercomput 77:4135\u20134150. https:\/\/doi.org\/10.1007\/s11227-020-03420-w","journal-title":"J Supercomput"},{"key":"5140_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2","author":"JA Bondy","year":"1976","unstructured":"Bondy JA, Murty USR (1976) Graph Theory with Applications. Am Elsevier Publ. https:\/\/doi.org\/10.1007\/978-1-349-03521-2","journal-title":"Am Elsevier Publ"},{"key":"5140_CR12","first-page":"337","volume":"21","author":"Chen Wen Chin","year":"1997","unstructured":"Chin Chen Wen, Lu Hsueh I, Yeh Yeong Nan (1997) Operations of interlaced trees and graceful trees. Southeast Asian Bull Math 21:337\u2013348","journal-title":"Southeast Asian Bull Math"},{"key":"5140_CR13","first-page":"37","volume-title":"A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson David S (1979) Computers and intractability. A guide to the theory of NP-completeness. W. H. Freeman, New York, pp 37\u201379"},{"key":"5140_CR14","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s000260050003","volume":"4","author":"L Bezrukov Sergei","year":"2000","unstructured":"Bezrukov Sergei L, Das Sajal K, Robert Els\u00e4sser (2000) An edge-isoperimetric problem for powers of the petersen graph. Ann Comb 4:153\u2013169. https:\/\/doi.org\/10.1007\/s000260050003","journal-title":"Ann Comb"},{"key":"5140_CR15","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/S0304-3975(03)00232-9","volume":"30","author":"L Bezrukov Sergei","year":"2003","unstructured":"Bezrukov Sergei L, Robert Els\u00e4sser (2003) Edge-isoperimetric problems for Cartesian powers of regular graphs. Theor Comput Sci 30:473\u2013492. https:\/\/doi.org\/10.1016\/S0304-3975(03)00232-9","journal-title":"Theor Comput Sci"},{"key":"5140_CR16","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0012-365X(01)00432-0","volume":"254","author":"A Carlson Thomas","year":"2002","unstructured":"Carlson Thomas A (2002) The edge-isoperimetric problem for discrete tori. Discret Math 254:33\u201349. https:\/\/doi.org\/10.1016\/S0012-365X(01)00432-0","journal-title":"Discret Math"},{"key":"5140_CR17","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/s0166-218x(00)00224-9","volume":"108","author":"R\u00f6ttger Markus","year":"2001","unstructured":"Markus R\u00f6ttger, Schroeder UP (2001) Efficient embeddings of grids into grids. Discret Appl Math 108:143\u2013173. https:\/\/doi.org\/10.1016\/s0166-218x(00)00224-9","journal-title":"Discret Appl Math"},{"key":"5140_CR18","doi-asserted-by":"publisher","first-page":"2778","DOI":"10.1016\/j.dam.2011.12.007","volume":"160","author":"Rajasingh Indra","year":"2012","unstructured":"Indra Rajasingh, Paul Manuel, Bharati Rajan, Micheal Arockiaraj (2012) Wirelength of hypercubes into certain trees. Discret Appl Math 160:2778\u20132786. https:\/\/doi.org\/10.1016\/j.dam.2011.12.007","journal-title":"Discret Appl Math"},{"key":"5140_CR19","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1016\/j.ipl.2011.06.011","volume":"18","author":"D Arockiaraj Micheal","year":"2011","unstructured":"Arockiaraj Micheal D, Paul Manuel, Indra Rajasingh, Bharati Rajan (2011) Wirelength of 1-fault Hamiltonian graphs into wheels and fans. Inf Process Lett 18:921\u2013925. https:\/\/doi.org\/10.1016\/j.ipl.2011.06.011","journal-title":"Inf Process Lett"},{"key":"5140_CR20","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1006\/eujc.1996.0105","volume":"18","author":"Ahlswede Rudolf","year":"1997","unstructured":"Rudolf Ahlswede, Ning Cai (1997) General edge-isoperimetric inequalities: part I. Inf Theor Methods 18:355\u2013372. https:\/\/doi.org\/10.1006\/eujc.1996.0105","journal-title":"Inf Theor Methods"},{"key":"5140_CR21","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.tcs.2017.12.036","volume":"721","author":"Bezrukov Sergei","year":"2018","unstructured":"Sergei Bezrukov, Pavle Bulatovic, Nikola Kuzmanovski (2018) New infinite family of regular edge-isoperimetric graphs. Theor Comput Sci 721:42\u201353. https:\/\/doi.org\/10.1016\/j.tcs.2017.12.036","journal-title":"Theor Comput Sci"},{"key":"5140_CR22","doi-asserted-by":"publisher","first-page":"69","DOI":"10.22457\/apam.v14n1a9","volume":"14","author":"J Quadras","year":"2017","unstructured":"Quadras J, Surya SS (2017) Wirelength of circulant networks into wheel related graphs. Ann Pure Appl Math 14:69\u201375","journal-title":"Ann Pure Appl Math"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05140-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-023-05140-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05140-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T07:12:50Z","timestamp":1686294770000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-023-05140-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,6]]},"references-count":22,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["5140"],"URL":"https:\/\/doi.org\/10.1007\/s11227-023-05140-3","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,6]]},"assertion":[{"value":"23 February 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"We declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"We adhered to the accepted ethical standards of a genuine research study.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"The author did not undertake work that involved Human or Animal participants.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Yes.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}