{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T15:39:24Z","timestamp":1768318764440,"version":"3.49.0"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1109\/tpds.2014.2307871","type":"journal-article","created":{"date-parts":[[2014,2,24]],"date-time":"2014-02-24T19:02:54Z","timestamp":1393268574000},"page":"45-53","source":"Crossref","is-referenced-by-count":24,"title":["Dimensional-Permutation-Based Independent Spanning Trees in Bijective Connection Networks"],"prefix":"10.1109","volume":"26","author":[{"given":"Baolei","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianxi","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohua","family":"Jia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/S1383-7621(99)00015-6"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2007.70729"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/71.744837"},{"key":"ref32","first-page":"143","article-title":"Optimal Independent Spanning Trees on Hypercubes","volume":"20","author":"tang","year":"2004","journal-title":"J Information Science and Eng"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2009.98"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/800255.810659"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.30"},{"key":"ref36","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1002\/net.20462","article-title":"Constructing Optimal Subnetworks for the Crossed Cube Network","volume":"60","author":"wang","year":"2012","journal-title":"Networks"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2007.351709"},{"key":"ref34","doi-asserted-by":"crossref","first-page":"2001","DOI":"10.1016\/j.tcs.2008.12.042","article-title":"On the Independent Spanning Trees of Recursive Circulant Graphs $G(cd^m,d)$<\/tex> <\/formula> with $d>2$<\/tex><\/formula>","volume":"410","author":"yang","year":"2009","journal-title":"Theoretical Computer Science"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/12.381950"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/BF02946526"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703436734"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/71.722224"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2010.12.011"},{"key":"ref14","first-page":"84","article-title":"BC Interconnection Networks and Their Properties","volume":"26","author":"fan","year":"2003","journal-title":"Chinese J Computers"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244198"},{"key":"ref16","first-page":"153","article-title":"Computing Prefixes on a Large Family of Interconnection Topologies","volume":"111","author":"hsu","year":"1992","journal-title":"Proc Int?l Conf Parallel Processing"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01202468"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s003730050041"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(88)90016-8"},{"key":"ref28","first-page":"1102","article-title":"A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs","volume":"e84 a","author":"nagai","year":"2001","journal-title":"IEICE Trans Fundamentals of Electronics Comm and Computer Science"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1016\/j.sysarc.2004.01.001","article-title":"Multi-Node Broadcasting in All-Ported 3-$D$<\/tex> <\/formula> Wormhole-Routed Torus Using an Aggregation-Then-Distribution Strategy","volume":"50","author":"chen","year":"2004","journal-title":"J Systems Architecture"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054199000149"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(97)00100-5"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1016\/j.jpdc.2013.01.009","article-title":"Dimension-Adjacent Trees and Parallel Construction of Independent Spanning Trees on Crossed Cubes","volume":"73","author":"cheng","year":"2013","journal-title":"J Parallel and Distributed Computing"},{"key":"ref29","first-page":"1894","article-title":"Independent Spanning Trees of Product Graphs and Their Construction","volume":"e79 a","author":"obokata","year":"1996","journal-title":"IEICE Trans Fundamentals of Electronics Comm and Computer Sciences"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.01.010"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-013-0883-1"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxs123"},{"key":"ref2","first-page":"796","article-title":"Reliable Broadcasting and Secure Distributing in Channel Networks","volume":"e81a","author":"bao","year":"1998","journal-title":"IEICE Trans Fundamentals of Electronics Comm and Computer Sciences"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(88)90015-6"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(91)90113-N"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1080\/0020716042000301752"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00205-1"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2006.12.001"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-009-0363-9"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2011.02.012"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.08.020"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)00167-W"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2011.09.002"},{"key":"ref23","author":"kulasinghe","year":"0"},{"key":"ref44","first-page":"44","article-title":"Independent Spanning Trees on Folded Hyper-Stars, Networks","volume":"56","author":"yang","year":"2010"},{"key":"ref26","first-page":"128","article-title":"Mapping Divide-and-Conquer Algorithms to Parallel Architectures","volume":"111","author":"lo","year":"1990","journal-title":"Proc Int?l Conf Parallel Processing"},{"key":"ref43","doi-asserted-by":"crossref","first-page":"1713","DOI":"10.1016\/j.jpdc.2012.07.003","article-title":"An Efficient Parallel Construction of Optimal Independent Spanning Trees on Hypercubes","volume":"72","author":"werapun","year":"2012","journal-title":"J Parallel and Distributed Computing"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.12.061"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/71\/6980150\/06747363.pdf?arnumber=6747363","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,24]],"date-time":"2024-05-24T14:46:10Z","timestamp":1716561970000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6747363\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1]]},"references-count":46,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tpds.2014.2307871","relation":{},"ISSN":["1045-9219"],"issn-type":[{"value":"1045-9219","type":"print"}],"subject":[],"published":{"date-parts":[[2015,1]]}}}