Results 231 to 240 of about 139,243 (275)

On independent spanning trees

Information Processing Letters, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Khuller, Samir, Schieber, Baruch
openaire   +1 more source

Edge-Independent Spanning Trees in Folded Crossed Cubes

SSRN Electronic Journal, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Huanwen, Wang, Yan, Fan, Jianxi, Shu, Chang   +3 more
openaire   +2 more sources

Independent spanning trees on folded hyper‐stars

Networks, 2010
AbstractFault‐tolerant broadcasting and secure message distribution are important issues for numerous applications in networks. It is a common idea to design multiple independent spanning trees (ISTs) as a broadcasting scheme or a distribution protocol for receiving high levels of fault‐tolerance and security. Recently, hyper‐stars were introduced as a
Yang, Jinn-Shyong, Chang, Jou-Ming
openaire   +1 more source

Independent spanning trees on twisted cubes

Journal of Parallel and Distributed Computing, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Yan, Fan, Jianxi, Zhou, Guodong, Jia, Xiaohua   +3 more
openaire   +1 more source

Constructing Node-Independent Spanning Trees in Augmented Cubes

Fundamenta Informaticae, 2020
For a network, edge/node-independent spanning trees (ISTs) can not only tolerate faulty edges/nodes, but also be used to distribute secure messages. As important node-symmetric variants of the hypercubes, the augmented cubes have received much attention from researchers.
Cheng, Baolei, Fan, Jianxi, Lyu, Qiang, Lin, Cheng-Kuan, Li, Xiaoyan, Chen, Guo   +5 more
openaire   +1 more source

Independent Spanning Trees in Networks: A Survey

ACM Computing Surveys, 2023
The problem of constructing independent spanning trees (ISTs) dates back to as early as the late 1980s. Given a network G of a certain topology, the question is whether we can, as well as how to, construct a set of ISTs in G .
Baolei Cheng, Dajin Wang, Jianxi Fan
openaire   +1 more source

Independent Spanning Trees on Folded Hypercubes

2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks, 2009
Fault-tolerant broadcasting and secure message distribution are important issues for numerous applications in networks. It is a common idea to design multiple spanning trees with a specific property in the underlying graph of a network to serve as a broadcasting scheme or a distribution protocol for receiving high levels of fault-tolerance and of ...
Jinn-Shyong Yang, Jou-Ming Chang, Hung–Chang Chan   +2 more
openaire   +1 more source

Topology-Independent Algorithms Based on Spanning Trees

1990
We consider a class of distributed algorithms. Algorithms in this class consist of processes that communicate using a broadcast. We show that local information suffices to implement such an algo rithm on an arbitrary network. We investigate the time complexity and present some experimental results.
Lukkien, J.J., Snepscheut, van de, J.L.A.   +1 more
openaire   +2 more sources

Independent Spanning Trees in RTCC-Pyramids

The Computer Journal, 2016
The independent spanning trees (ISTs) problem is asked to find k spanning trees rooted at a designated vertex r such that, for any vertex v, all paths connecting r and v in k spanning trees are pairwise internally disjoint in the given graph. ISTs have numerous applications in networks such as reliable communication protocols, data broadcasting and ...
Wang, SI (Wang, Shuo-I), Wang, FH (Wang, Fu-Hsing)   +1 more
openaire   +1 more source

Average Distance, Independence Number, and Spanning Trees

Journal of Graph Theory, 2013
AbstractLet G be a connected graph of order n and independence number α. We prove that G has a spanning tree with average distance at most , if , and at most , if . As a corollary, we obtain, for n sufficiently large, an asymptotically sharp upper bound on the average distance of G in terms of its independence number.
openaire   +1 more source