{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T07:46:51Z","timestamp":1759132011712},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,11,25]],"date-time":"2009-11-25T00:00:00Z","timestamp":1259107200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2011,5]]},"DOI":"10.1007\/s11227-009-0363-9","type":"journal-article","created":{"date-parts":[[2009,11,24]],"date-time":"2009-11-24T10:04:24Z","timestamp":1259057064000},"page":"212-225","source":"Crossref","is-referenced-by-count":19,"title":["Optimal Independent Spanning Trees on Odd Graphs"],"prefix":"10.1007","volume":"56","author":[{"given":"Jong-Seok","family":"Kim","sequence":"first","affiliation":[]},{"given":"Hyeong-Ok","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Eddie","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"L\u00e1szl\u00f3","family":"Lipt\u00e1k","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,11,25]]},"reference":[{"key":"363_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(97)00100-5","volume":"83","author":"F Bao","year":"1998","unstructured":"Bao F, Igarashi Y, \u00d6hring SR (1998) Reliable broadcasting in product networks. Discrete Appl Math 83:3\u201320","journal-title":"Discrete Appl Math"},{"key":"363_CR2","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1111\/j.1749-6632.1979.tb32775.x","volume":"319","author":"N Biggs","year":"1979","unstructured":"Biggs N (1979) Some odd graph theory. Ann NY Acad Sci 319:71\u201381","journal-title":"Ann NY Acad Sci"},{"key":"363_CR3","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/0196-6774(88)90015-6","volume":"9","author":"J Cheriyan","year":"1988","unstructured":"Cheriyan J, Maheshwari SN (1988) Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs. J Algorithms 9:507\u2013537","journal-title":"J Algorithms"},{"key":"363_CR4","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.1137\/S0097539703436734","volume":"35","author":"S Curran","year":"2006","unstructured":"Curran S, Lee O, Yu X (2006) Finding four independent trees. SIAM J Comput 35:1023\u20131058","journal-title":"SIAM J Comput"},{"key":"363_CR5","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1137\/S0097539793244198","volume":"26","author":"Z Ge","year":"1997","unstructured":"Ge Z, Hakimi SL (1997) Disjoint rooted spanning trees with small depths in de Bruijn and Kautz graphs. SIAM J Comput 26:79\u201392","journal-title":"SIAM J Comput"},{"issue":"2","key":"363_CR6","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1109\/12.73594","volume":"40","author":"A Ghafoor","year":"1991","unstructured":"Ghafoor A, Bashkow TR (1991) A study of odd graphs as fault-tolerant interconnection networks. IEEE Trans Comput 40(2):225\u2013232","journal-title":"IEEE Trans Comput"},{"key":"363_CR7","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0166-218X(00)00269-9","volume":"110","author":"T Hasunuma","year":"2001","unstructured":"Hasunuma T, Nagamochi H (2001) Independent spanning trees with small depths in iterated line digraphs. Discrete Appl Math 110:189\u2013211","journal-title":"Discrete Appl Math"},{"key":"363_CR8","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1016\/j.tcs.2008.12.025","volume":"410","author":"S-Y Hsieh","year":"2009","unstructured":"Hsieh S-Y, Tu C-J (2009) Constructing edge-disjoint spanning trees in locally twisted cubes. Theor Comput Sci 410:926\u2013932","journal-title":"Theor Comput Sci"},{"key":"363_CR9","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01202468","volume":"10","author":"A Huck","year":"1994","unstructured":"Huck A (1994) Independent trees in graphs. Graphs Comb 10:29\u201345","journal-title":"Graphs Comb"},{"key":"363_CR10","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s003730050041","volume":"15","author":"A Huck","year":"1999","unstructured":"Huck A (1999) Independent trees in planar graphs. Graphs Comb 15:29\u201377","journal-title":"Graphs Comb"},{"key":"363_CR11","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0890-5401(88)90016-8","volume":"79","author":"A Itai","year":"1988","unstructured":"Itai A, Rodeh M (1988) The multi-tree approach to reliability in distributed networks. Inf Comput 79:43\u201359","journal-title":"Inf Comput"},{"key":"363_CR12","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0020-0190(98)00205-1","volume":"69","author":"Y Iwasaki","year":"1999","unstructured":"Iwasaki Y, Kajiwara Y, Obokata K, Ugarashi Y (1999) Independent spanning trees of chordal rings. Inf Process Lett 69:155\u2013160","journal-title":"Inf Process Lett"},{"issue":"6","key":"363_CR13","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1109\/TC.2008.53","volume":"57","author":"J-S Kim","year":"2008","unstructured":"Kim J-S, Lee H-O (2008) Comments on \u201cA study of odd graphs as fault-tolerant interconnection networks. IEEE Trans Comput 57(6):864","journal-title":"IEEE Trans Comput"},{"issue":"6","key":"363_CR14","doi-asserted-by":"crossref","first-page":"856","DOI":"10.4218\/etrij.08.0208.0272","volume":"30","author":"J-S Kim","year":"2008","unstructured":"Kim J-S, Lee H-O (2008) One-to-all broadcasting of odd networks for one-port and all-port models. ETRI J 30(6):856\u2013858","journal-title":"ETRI J"},{"key":"363_CR15","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1080\/00207160701691431","volume":"86","author":"J-S Kim","year":"2009","unstructured":"Kim J-S, Cheng E, Lipt\u00e1k L, Lee H-O (2009) Embedding hypercubes, rings and odd graphs into hyper-stars. Int J Comput Math 86:771\u2013778","journal-title":"Int J Comput Math"},{"key":"363_CR16","first-page":"229","volume-title":"Combinatorics","author":"GHJ Meredith","year":"1972","unstructured":"Meredith GHJ, Llyod EK (1972) The Hamiltonian graphs O 4 to O 7. In: Welsh DJA, Woodal DR (eds) Combinatorics. Institute of Mathematics and Applications, Southend-On-Sea, pp 229\u2013236"},{"key":"363_CR17","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1142\/S0129054199000149","volume":"10","author":"K Miura","year":"1999","unstructured":"Miura K, Takahashi D, Nakano S, Nishizeki T (1999) A linear-time algorithm to find four independent spanning trees in four-connected planar graphs. Int J Found Comput Sci 10:195\u2013210","journal-title":"Int J Found Comput Sci"},{"key":"363_CR18","unstructured":"Nagai S, Nakano S (2000) A linear-time algorithm to find independent spanning trees in maximal planar graphs. In Proceedings of 26th workshop on graph\u2014theoretic concepts in computer science, WG 2000. LNCS, vol 1928, pp 290\u2013301"},{"key":"363_CR19","first-page":"1894","volume":"E79-A","author":"K Obokata","year":"1996","unstructured":"Obokata K, Iwasaki Y, Bao F, Igarashi Y (1996) Independent spanning trees of product graphs and their construction. IEICE Trans Fundam Electron Commun Comput Sci E79-A:1894\u20131903","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci"},{"issue":"1","key":"363_CR20","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1109\/71.899940","volume":"12","author":"B Parhami","year":"2001","unstructured":"Parhami B, Kwai D-M (2001) Unified formulation of honeycomb and diamond networks. IEEE Trans Parallel Distrib Syst 12(1):74\u201380","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"363_CR21","first-page":"143","volume":"20","author":"S-M Tang","year":"2004","unstructured":"Tang S-M, Wang Y-L, Leu Y-H (2004) Optimal independent spanning trees on hypercubes. J Inf Sci Eng 20:143\u2013155","journal-title":"J Inf Sci Eng"},{"key":"363_CR22","doi-asserted-by":"crossref","unstructured":"Tang S-M, Yang J-S, Wang Y-L, Chang J-M (2009) Independent spanning trees on multidimensional torus networks. IEEE Trans Comput (to appear)","DOI":"10.1109\/TC.2009.98"},{"key":"363_CR23","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.parco.2006.12.001","volume":"33","author":"J-S Yang","year":"2007","unstructured":"Yang J-S, Tang S-M, Chang J-M, Wang Y-L (2007) Parallel construction of optimal independent spanning trees on hypercubes. Parallel Comput 33:73\u201379","journal-title":"Parallel Comput"},{"issue":"5","key":"363_CR24","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TPDS.2007.351709","volume":"18","author":"J-S Yang","year":"2007","unstructured":"Yang J-S, Chang J-M, Tang S-M, Wang Y-L (2007) Reducing the height of independent spanning trees in chordal rings. IEEE Trans Parallel Distrib Syst 18(5):644\u2013657","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"363_CR25","doi-asserted-by":"crossref","first-page":"2001","DOI":"10.1016\/j.tcs.2008.12.042","volume":"410","author":"J-S Yang","year":"2009","unstructured":"Yang J-S, Chang J-M, Tang S-M, Wang Y-L (2009) On the independent spanning trees of recursive circulant graphs G(cd m ,d) with d>2. Theor Comput Sci 410:2001\u20132010","journal-title":"Theor Comput Sci"},{"key":"363_CR26","doi-asserted-by":"crossref","unstructured":"Yang J-S, Chang J-M, Tang S-M, Wang Y-L (2009) Constructing multiple independent spanning trees on recursive circulant graphs G(2 m ,2). Int J Found Comput Sci (to appear)","DOI":"10.1142\/S0129054110007143"},{"key":"363_CR27","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1002\/jgt.3190130205","volume":"13","author":"A Zehavi","year":"1989","unstructured":"Zehavi A, Itai A (1989) Three tree-paths. J Graph Theory 13:175\u2013188","journal-title":"J Graph Theory"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-009-0363-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-009-0363-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-009-0363-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:24:00Z","timestamp":1559384640000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-009-0363-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,25]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["363"],"URL":"https:\/\/doi.org\/10.1007\/s11227-009-0363-9","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11,25]]}}}