{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T01:57:52Z","timestamp":1649123872773},"reference-count":35,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2015,12]]},"abstract":"<jats:p> An incomplete recursive circulant possesses virtually every advantage of a complete recursive circulant, including simple deadlock-free routing, a small diameter, a good support of parallel algorithms, and so on. It is natural to reconfigure a faulty recursive circulant into a maximum incomplete recursive circulant so as to lower potential performance degradation. For [Formula: see text], the maximum incomplete subgraph problem is to identify a subgraph [Formula: see text] of a graph [Formula: see text] on [Formula: see text] vertices having the maximum number of edges among all subgraphs on [Formula: see text] vertices and is NP-complete. In this paper we identify maximum incomplete recursive circulants and use them as a tool to compute the exact wirelength of embedding recursive circulants into special classes of trees, such as [Formula: see text]-rooted complete binary trees, [Formula: see text]-rooted sibling trees, binomial trees, certain caterpillars and path. <\/jats:p>","DOI":"10.1142\/s1793830915500536","type":"journal-article","created":{"date-parts":[[2015,10,9]],"date-time":"2015-10-09T09:25:45Z","timestamp":1444382745000},"page":"1550053","source":"Crossref","is-referenced-by-count":0,"title":["Maximum incomplete recursive circulants in graph embeddings"],"prefix":"10.1142","volume":"07","author":[{"given":"R.","family":"Sundara Rajan","sequence":"first","affiliation":[{"name":"School of Mathematical and Physical Sciences, The University of Newcastle, Callaghan, NSW 2308, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Indra","family":"Rajasingh","sequence":"additional","affiliation":[{"name":"School of Advanced Sciences, VIT University, Chennai 600 127, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Manuel","sequence":"additional","affiliation":[{"name":"Department of Information Science, Kuwait University, Safat 13060, Kuwait"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mirka","family":"Miller","sequence":"additional","affiliation":[{"name":"School of Mathematical and Physical Sciences, The University of Newcastle, Callaghan, NSW 2308, Australia"},{"name":"Department of Mathematics, University of West Bohemia, Pilsen, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. M.","family":"Rajalaxmi","sequence":"additional","affiliation":[{"name":"Department of Mathematics, SSN College of Engineering, Chennai 603 110, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2016,1,4]]},"reference":[{"key":"S1793830915500536BIB001","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.06.011"},{"key":"S1793830915500536BIB002","doi-asserted-by":"publisher","DOI":"10.1007\/BF01205666"},{"key":"S1793830915500536BIB003","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1995.1002"},{"key":"S1793830915500536BIB004","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0055820"},{"key":"S1793830915500536BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)00162-4"},{"key":"S1793830915500536BIB006","doi-asserted-by":"publisher","DOI":"10.1007\/s000260050003"},{"key":"S1793830915500536BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(97)00101-7"},{"key":"S1793830915500536BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)00199-5"},{"key":"S1793830915500536BIB009","doi-asserted-by":"publisher","DOI":"10.1137\/0207026"},{"key":"S1793830915500536BIB010","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-011-0027-7"},{"key":"S1793830915500536BIB011","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(98)00098-5"},{"key":"S1793830915500536BIB012","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001"},{"key":"S1793830915500536BIB013","doi-asserted-by":"publisher","DOI":"10.1145\/568522.568523"},{"key":"S1793830915500536BIB014","volume-title":"Telecoms in the Internet Age: From Boom to Bust to...?","author":"Fransman M.","year":"2002"},{"key":"S1793830915500536BIB015","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979"},{"key":"S1793830915500536BIB016","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90059-1"},{"key":"S1793830915500536BIB018","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511616679"},{"key":"S1793830915500536BIB019","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0118(199906)31:2<75::AID-JGT1>3.0.CO;2-S"},{"key":"S1793830915500536BIB020","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(95)00078-6"},{"key":"S1793830915500536BIB021","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2010.12.001"},{"key":"S1793830915500536BIB022","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.07.003"},{"key":"S1793830915500536BIB023","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.09.013"},{"key":"S1793830915500536BIB024","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxu031"},{"key":"S1793830915500536BIB026","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00176-6"},{"key":"S1793830915500536BIB027","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-011-9443-x"},{"key":"S1793830915500536BIB028","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.12.007"},{"key":"S1793830915500536BIB029","doi-asserted-by":"publisher","DOI":"10.1002\/net.20027"},{"key":"S1793830915500536BIB031","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2012.03.006"},{"key":"S1793830915500536BIB032","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2012.697557"},{"key":"S1793830915500536BIB033","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2008.04.051"},{"key":"S1793830915500536BIB034","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.10.004"},{"key":"S1793830915500536BIB036","doi-asserted-by":"publisher","DOI":"10.1142\/S0219265902000677"},{"key":"S1793830915500536BIB037","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.05.013"},{"key":"S1793830915500536BIB038","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3387-7"},{"key":"S1793830915500536BIB039","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2008.10.040"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830915500536","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:34:09Z","timestamp":1565123649000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830915500536"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12]]},"references-count":35,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2016,1,4]]},"published-print":{"date-parts":[[2015,12]]}},"alternative-id":["10.1142\/S1793830915500536"],"URL":"https:\/\/doi.org\/10.1142\/s1793830915500536","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12]]}}}