Results 231 to 240 of about 140,549 (266)
Some of the next articles are maybe not open access.
Independent Spanning Trees on Folded Hypercubes
2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks, 2009Fault-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 +2 more
openaire +1 more source
Independent Spanning Trees in RTCC-Pyramids
The Computer Journal, 2016The 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) +1 more
openaire +1 more source
Independent spanning trees on twisted cubes
Journal of Parallel and Distributed Computing, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yan Wang 0078 +3 more
openaire +1 more source
Two counterexamples on completely independent spanning trees
Discrete Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +3 more sources
Independent spanning trees on folded hyper‐stars
Networks, 2010AbstractFault‐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
Jinn-Shyong Yang, Jou-Ming Chang
openaire +1 more source
Edge-Independent Spanning Trees in Folded Crossed Cubes
SSRN Electronic Journal, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Huanwen Zhang +3 more
openaire +2 more sources
Independent spanning trees of product graphs
1997A graph G is called an n-channel graph at vertex r if there are n independent spanning trees rooted at r. A graph G is called an n-channel graph if for every vertex u, G is an n-channel graph at u. Independent spanning trees of a graph play an important role in faulttolerant broadcasting in the graph.
Koji Obokata +3 more
openaire +2 more sources
Degree condition for completely independent spanning trees
Information Processing Letters, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xia Hong 0001, Qinghai Liu
openaire +1 more source
Two completely independent spanning trees of split graphs
Discrete Applied Mathematics, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaodong Chen, Qinghai Liu, Xiwu Yang
openaire +2 more sources
Optimal Independent Spanning Trees on Odd Graphs
The Journal of Supercomputing, 2009The 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. The designs of multiple ISTs on several classes of networks have been widely investigated.
Jong-Seok Kim +3 more
openaire +1 more source