Results 261 to 270 of about 3,644,794 (274)

Parallel construction of optimal independent spanning trees on hypercubes

Parallel Computing, 2007
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. Tang et al. [S.-M. Tang, Y.-L. Wang, Y.-H.
Jinn-Shyong Yang, Shyue-Ming Tang, Jou-Ming Chang, Yue-Li Wang   +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, 2014
Zehavi 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, Jinn-Shyong Yang, Jou-Ming Chang, Yue-Li Wang   +3 more
openaire   +1 more source

A counterexample for the proof of implication conjecture on independent spanning trees

Information Processing Letters, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abishek Gopalan, Srinivasan Ramasubramanian   +1 more
openaire   +2 more sources

Completely Independent Spanning Trees in Maximal Planar Graphs

2002
Let G be a graph. Let T1, T2, . . . , Tk be spanning trees in G. If for any two vertices u, v in G, the paths from u to v in T1, T2, . . . , Tk are pairwise openly disjoint, then we say that T1, T2, . . . , Tk are completely independent spanning trees in G.
openaire   +2 more sources

Dirac's Condition for Completely Independent Spanning Trees

Journal of Graph Theory, 2014
Toru Araki
exaly  

On the independent spanning trees of recursive circulant graphsG(cdm,d)withd>2

Theoretical Computer Science, 2009
Shyue-Ming Tang, Jou-Ming Chang, Yue-Li Wang   +2 more
exaly  

Independent spanning trees of chordal rings

Information Processing Letters, 1999
Yoshihide Igarashi
exaly  

Reducing the Height of Independent Spanning Trees in Chordal Rings

IEEE Transactions on Parallel and Distributed Systems, 2007
Shyue-Ming Tang, Jou-Ming Chang, Yue-Li Wang   +2 more
exaly  

Inferring patterns in mitochondrial DNA sequences through hypercube independent spanning trees

Computers in Biology and Medicine, 2016
Helio Pedrini
exaly  

Broadcasting secure messages via optimal independent spanning trees in folded hypercubes

Discrete Applied Mathematics, 2011
Jou-Ming Chang, Hung-Chang Chan, Jinn-Shyong Yang   +2 more
exaly