{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:43:09Z","timestamp":1777596189871,"version":"3.51.4"},"reference-count":16,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[2003,12]]},"DOI":"10.1016\/s0743-7315(03)00107-2","type":"journal-article","created":{"date-parts":[[2003,11,20]],"date-time":"2003-11-20T08:03:07Z","timestamp":1069315387000},"page":"1277-1287","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":15,"title":["Embedding k(n\u2212k) edge-disjoint spanning trees in arrangement graphs"],"prefix":"10.1016","volume":"63","author":[{"given":"Chin-Tsai","family":"Lin","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0743-7315(03)00107-2_BIB1","unstructured":"S.B. Akers, D. Harel, B. Krishnamurthy, The star graph: an attractive alternative to the n-cube, in: Proceedings of the 1987 International Conference on Parallel Processing, pp. 393\u2013400, Pennsylvania State University, University Park, PA, 1987."},{"issue":"4","key":"10.1016\/S0743-7315(03)00107-2_BIB2","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1109\/12.21148","article-title":"A group theoretic model for symmetric interconnection networks","volume":"38","author":"Akers","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0743-7315(03)00107-2_BIB3","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S1383-7621(00)00041-2","article-title":"Congestion-free embedding of 2(n\u2212k) spanning trees in an arrangement graph","volume":"47","author":"Chen","year":"2001","journal-title":"J. Systems Architecture"},{"key":"10.1016\/S0743-7315(03)00107-2_BIB4","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0020-0190(98)00052-0","article-title":"On the arrangement graph","volume":"66","author":"Chiang","year":"1998","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0743-7315(03)00107-2_BIB5","unstructured":"K. Day, A. Tripathi, Characterization of node disjoint path in arrangement graphs, Technical Report, TR91-43, Computer Science Department, University of Minnesota, 1991."},{"key":"10.1016\/S0743-7315(03)00107-2_BIB6","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0020-0190(92)90030-Y","article-title":"Arrangement graphs","volume":"42","author":"Day","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0743-7315(03)00107-2_BIB7","doi-asserted-by":"crossref","unstructured":"K. Day, A. Tripathi, Embedding grids, hypercubes, and trees in arrangement graphs, in: Proceedings of the International Conference on Parallel Processing, Vol. III, pp. 65\u201372, Syracuse University, NY, 1993.","DOI":"10.1109\/ICPP.1993.76"},{"key":"10.1016\/S0743-7315(03)00107-2_BIB8","doi-asserted-by":"crossref","first-page":"1002","DOI":"10.1109\/12.238494","article-title":"Embedding of cycles in arrangement graphs","volume":"42","author":"Day","year":"1993","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"10.1016\/S0743-7315(03)00107-2_BIB9","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1109\/12.485370","article-title":"Edge-disjoint spanning trees on the star network with applications to fault tolerance","volume":"45","author":"Fragopoulou","year":"1996","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0743-7315(03)00107-2_BIB10","unstructured":"P. Fraigniaud, C.T. Ho, Arc-disjoint spanning trees on the cube connected cycles network, in: Proceedings of the International Conference on Parallel Processing, Vol. I, St. Charles, IL, 1991, pp. 225\u2013229."},{"key":"10.1016\/S0743-7315(03)00107-2_BIB11","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1109\/71.755822","article-title":"Fault-free Hamiltonian cycles in faulty arrangement graphs","volume":"10","author":"Hsieh","year":"1999","journal-title":"IEEE Trans. Parallel Distrib. Systems"},{"issue":"9","key":"10.1016\/S0743-7315(03)00107-2_BIB12","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1109\/12.29465","article-title":"Optimal broadcasting and personalized communication in hypercubes","volume":"38","author":"Johnson","year":"1989","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/S0743-7315(03)00107-2_BIB13","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1002\/net.3230230414","article-title":"A new class of interconnection networks based on the alternating group","volume":"23","author":"Jwo","year":"1993","journal-title":"Networks"},{"key":"10.1016\/S0743-7315(03)00107-2_BIB14","unstructured":"D.K. Knuth, The Art of Computer Programming, Vol. I, Addison\u2013Wesley, Reading, MA, 1973."},{"issue":"2","key":"10.1016\/S0743-7315(03)00107-2_BIB15","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1109\/71.910874","article-title":"Embedding Hamiltonian paths in arrangement graphs with the backtracking method","volume":"12","author":"Lo","year":"2001","journal-title":"IEEE Trans. Parallel Distrib. Systems"},{"issue":"5","key":"10.1016\/S0743-7315(03)00107-2_BIB16","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1109\/12.589231","article-title":"Toward optimal broadcast in a star graph using multiple spanning trees","volume":"46","author":"Tseng","year":"1997","journal-title":"IEEE Trans. Comput."}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731503001072?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731503001072?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T21:52:11Z","timestamp":1760046731000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743731503001072"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":16,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S0743731503001072"],"URL":"https:\/\/doi.org\/10.1016\/s0743-7315(03)00107-2","relation":{},"ISSN":["0743-7315"],"issn-type":[{"value":"0743-7315","type":"print"}],"subject":[],"published":{"date-parts":[[2003,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Embedding k(n\u2212k) edge-disjoint spanning trees in arrangement graphs","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0743-7315(03)00107-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}