Independent spanning trees on even networks

被引：26

作者：

Kim, Jong-Seok ^{[2
]}

Lee, Hyeong-Ok ^{[1
]}

Cheng, Eddie ^{[3
]}

Liptak, Laszlo ^{[3
]}

机构：

[1] Sunchon Natl Univ, Dept Comp Educ, Sunchon 540742, Chonnam, South Korea

[2] Yeungnam Univ, Dept Informat & Commun Engn, Kyongsan 712749, Gyeongbuk, South Korea

[3] Oakland Univ, Dept Math & Stat, Rochester, MI 48309 USA

来源：

INFORMATION SCIENCES | 2011年 / 181卷 / 13期

关键词：

Independent spanning trees; Even networks; Internally disjoint paths; Algorithms; SMALL DEPTHS; RELIABILITY; GRAPHS; CYCLES; PATHS;

D O I：

10.1016/j.ins.2011.02.012

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The use of multiple independent spanning trees (ISTs) for data broadcasting in networks provides a number of advantages, including the increase of fault-tolerance and bandwidth. Thus, the designs of multiple ISTs on several classes of networks have been widely investigated. In this paper, we give an algorithm to construct ISTs on even networks, and show that these ISTs are optimal for height and path lengths, and each path in the ISTs has length at most the length of the shortest path+4 in the even network. (C) 2011 Elsevier Inc. All rights reserved.

引用

页码：2892 / 2905

页数：14

共 50 条

[21] Fault Tolerance for Hypercube Networks Via Independent Spanning Trees
Umrao, Lokendra Singh
Mahato, Dharmendra Prasad
Singh, Ravi Shankar
2014 INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED AND GRID COMPUTING (PDGC), 2014, : 191 - 195
[22] ON INDEPENDENT SPANNING-TREES
KHULLER, S
SCHIEBER, B
INFORMATION PROCESSING LETTERS, 1992, 42 (06) : 321 - 323
[23] Linear time algorithms for finding independent spanning trees on pyramid networks
Wang, Shuo-, I
Wang, Fu-Hsing
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2020, 39 (03) : 826 - 848
[24] Recursive and parallel constructions of independent spanning trees in alternating group networks
Huang, Jie-Fu
Hsieh, Sun-Yuan
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS- COMPUTER SYSTEMS THEORY, 2020, 5 (04) : 234 - 262
[25] Two Methods for Constructing Independent Spanning Trees in Alternating Group Networks
Huang, Jie-Fu
Hsieh, Sun-Yuan
COMPANION OF THE 2020 IEEE 20TH INTERNATIONAL CONFERENCE ON SOFTWARE QUALITY, RELIABILITY, AND SECURITY (QRS-C 2020), 2020, : 616 - 621
[26] Linear time algorithms for finding independent spanning trees on pyramid networks
Shuo-I Wang
Fu-Hsing Wang
Journal of Combinatorial Optimization, 2020, 39 : 826 - 848
[27] Spanning trees and even integer eigenvalues of graphs
Ghorbani, Ebrahim
DISCRETE MATHEMATICS, 2014, 324 : 62 - 67
[28] Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees
Darties, Benoit
Gastineau, Nicolas
Togni, Olivier
DISCRETE APPLIED MATHEMATICS, 2018, 236 : 124 - 136
[29] Optimal independent spanning trees on hypercubes
Tang, SM
Wang, YL
Leu, YH
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2004, 20 (01) : 143 - 155
[30] Independent Spanning Trees on Folded Hypercubes
Yang, Jinn-Shyong
Chang, Jou-Ming
Chan, Hung-Chang
2009 10TH INTERNATIONAL SYMPOSIUM ON PERVASIVE SYSTEMS, ALGORITHMS, AND NETWORKS (ISPAN 2009), 2009, : 601 - +

← 1 2 3 4 5 →