Results 161 to 170 of about 3,899,169 (179)
Some of the next articles are maybe not open access.
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
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
Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
Information Processing Letters, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jia-Cian Lin +3 more
openaire +3 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
Parallel construction of optimal independent spanning trees on hypercubes
Parallel Computing, 2007The 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. Tang et al. [S.-M. Tang, Y.-L. Wang, Y.-H.
Jinn-Shyong Yang +3 more
openaire +2 more sources
Parallel Construction of Independent Spanning Trees on Parity Cubes
2014 IEEE 17th International Conference on Computational Science and Engineering, 2014Zehavi and Itai (1989) proposed the following conjecture: every k-connected graph has k independent spanning trees (ISTs for short) rooted at an arbitrary node. An n-dimensional parity cube, denoted by PQn, is a variation of hyper cubes with connectivity n and has many features superior to those of hyper cubes. Recently, Wang et al.
Yu-Huei Chang +3 more
openaire +1 more source
Constructing Independent Spanning Trees on Bubble-Sort Networks
2018A set of spanning trees in a graph G is called independent spanning trees (ISTs for short) if they are rooted at the same vertex, say r, and for each vertex \(v(\ne r)\) in G, the two paths from v to r in any two trees share no common vertex except for v and r.
Shih-Shun Kao +3 more
openaire +2 more sources
Dominator Certification and Independent Spanning Trees: An Experimental Study
2013We present the first implementations of certified algorithms for computing dominators, and exhibit their efficiency experimentally on graphs taken from a variety of applications areas. The certified algorithms are obtained by augmenting dominator-finding algorithms to compute a certificate of correctness that is easy to verify.
Loukas Georgiadis +3 more
openaire +2 more sources