Results 251 to 260 of about 3,644,794 (274)
Some of the next articles are maybe not open access.
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 +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
Finding Independent Spanning Trees in Partial k-Trees
2000Spanning trees rooted at a vertex r of a graph G are independent if, for each vertex v in G, all the paths connecting v and r in the trees are pairwise internally disjoint. In this paper we give a linear-time algorithm to find the maximum number of independent spanning trees rooted at any given vertex r in partial k-trees G, that is, graphs G with tree-
Xiao Zhou 0001, Takao Nishizeki
openaire +1 more source
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 +2 more sources
Constructing Node-Independent Spanning Trees in Augmented Cubes
Fundamenta Informaticae, 2020For 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.
Baolei Cheng +5 more
openaire +1 more source
Completely independent spanning trees in torus networks
Networks, 2011AbstractLet T1, T2, …, Tk be spanning trees in a graph G. If for any two vertices u, v in G, the paths from u to v in T1, T2, …, Tk are pairwise internally disjoint, then T1, T2, …, Tk are completely independent spanning trees in G. Completely independent spanning trees can be applied to fault‐tolerant communication problems in interconnection networks.
Toru Hasunuma, Chie Morisaka
openaire +3 more sources
Independent Spanning Trees on Multidimensional Torus Networks
IEEE Transactions on Computers, 2010Two spanning trees rooted at vertex r in a graph G are called independent spanning trees (ISTs) if for each vertex v in G, vner, the paths from vertex v to vertex r in these two trees are internally distinct. If the connectivity of G is k, the IST problem is to construct k ISTs rooted at each vertex.
Shyue-Ming Tang +3 more
openaire +3 more sources
Average Distance, Independence Number, and Spanning Trees
Journal of Graph Theory, 2013AbstractLet 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 +2 more sources
Dirac's Condition for Completely Independent Spanning Trees
Journal of Graph Theory, 2013AbstractTwo spanning trees T1 and T2 of a graph G are completely independent if, for any two vertices u and v, the paths from u to v in T1 and T2 are internally disjoint. In this article, we show two sufficient conditions for the existence of completely independent spanning trees. First, we show that a graph of n vertices has two completely independent
openaire +1 more source
Topology-Independent Algorithms Based on Spanning Trees
1990We 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. +1 more
openaire +2 more sources