{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T14:20:04Z","timestamp":1778595604985,"version":"3.51.4"},"reference-count":23,"publisher":"Informa UK Limited","issue":"5","funder":[{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","award":["TAR\/2023\/000041"],"award-info":[{"award-number":["TAR\/2023\/000041"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Parallel, Emergent and Distributed Systems"],"published-print":{"date-parts":[[2025,9,3]]},"DOI":"10.1080\/17445760.2025.2472203","type":"journal-article","created":{"date-parts":[[2025,3,3]],"date-time":"2025-03-03T00:55:06Z","timestamp":1740963306000},"page":"596-612","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":2,"title":["Optimizing network structures: solving the maximum subgraph problem in grid networks"],"prefix":"10.1080","volume":"40","author":[{"given":"Rini","family":"Dominic","sequence":"first","affiliation":[{"name":"Hindustan Institute of Technology and Science","place":["Chennai, India"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Sundara Rajan","sequence":"additional","affiliation":[{"name":"Hindustan Institute of Technology and Science","place":["Chennai, India"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. M.","family":"Rajalaxmi","sequence":"additional","affiliation":[{"name":"Sri Sivasubramaniya Nadar College of Engineering","place":["Chennai, India"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Manuel","sequence":"additional","affiliation":[{"name":"Kuwait University","place":["Safat, Kuwait"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2025,3,2]]},"reference":[{"key":"e_1_3_3_2_1","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00644"},{"key":"e_1_3_3_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.09.013"},{"key":"e_1_3_3_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11786-011-0085-2"},{"key":"e_1_3_3_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-011-9443-x"},{"key":"e_1_3_3_6_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJNVO.2017.083547"},{"key":"e_1_3_3_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.05.034"},{"key":"e_1_3_3_8_1","doi-asserted-by":"publisher","DOI":"10.3233\/FI-2021-2003"},{"key":"e_1_3_3_9_1","doi-asserted-by":"publisher","DOI":"10.3233\/FI-222149"},{"key":"e_1_3_3_10_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0219265924500075"},{"key":"e_1_3_3_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-60239-0_4"},{"key":"e_1_3_3_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2018.05.056"},{"issue":"1","key":"e_1_3_3_13_1","first-page":"358","article-title":"Minimum linear arrangement of chord graphs","volume":"208","author":"Rostami H","year":"2008","unstructured":"Rostami H, Habibi J. Minimum linear arrangement of chord graphs. Appl Math Comput. 2008;208(1):358\u2013367.","journal-title":"Appl Math Comput"},{"key":"e_1_3_3_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3498851.3498998"},{"key":"e_1_3_3_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-25211-2_31"},{"key":"e_1_3_3_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12190-008-0155-z"},{"key":"e_1_3_3_17_1","doi-asserted-by":"publisher","DOI":"10.1080\/10637199608915560"},{"key":"e_1_3_3_18_1","series-title":"Series of Books in the Mathematical Sciences","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"Garey MR","year":"1979","unstructured":"Garey MR, Johnson DS. Computers and intractability: A guide to the theory of NP-completeness. 1st ed. New York: W. H. Freeman; 1979. (Series of Books in the Mathematical Sciences).","edition":"1"},{"key":"e_1_3_3_19_1","first-page":"e8058","article-title":"Optimal layout of embedding onto folded hypercubes","volume":"36","author":"Dominic R","year":"2025","unstructured":"Dominic R, Rajan RS, Rajalaxmi TM, et\u00a0al. Optimal layout of embedding onto folded hypercubes. Int J Found Computer Sci. 2025;36:e8058.","journal-title":"Int J Found Computer Sci"},{"key":"e_1_3_3_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.v7:1"},{"key":"e_1_3_3_21_1","first-page":"37","article-title":"Optimization of resource allocation in computational grids","volume":"6","author":"Das D.","year":"2015","unstructured":"Das D. Optimization of resource allocation in computational grids. Int J Grid Comput Appl. 2015;6:37\u201354.","journal-title":"Int J Grid Comput Appl"},{"key":"e_1_3_3_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45848-4_6"},{"key":"e_1_3_3_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2012.01.026"},{"key":"e_1_3_3_24_1","doi-asserted-by":"publisher","DOI":"10.1038\/nrg2085"}],"container-title":["International Journal of Parallel, Emergent and Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/17445760.2025.2472203","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T15:27:56Z","timestamp":1756740476000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/17445760.2025.2472203"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,2]]},"references-count":23,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,9,3]]}},"alternative-id":["10.1080\/17445760.2025.2472203"],"URL":"https:\/\/doi.org\/10.1080\/17445760.2025.2472203","relation":{},"ISSN":["1744-5760","1744-5779"],"issn-type":[{"value":"1744-5760","type":"print"},{"value":"1744-5779","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,2]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=gpaa20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=gpaa20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2024-07-05","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-02-21","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-03-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}