Results 151 to 160 of about 3,899,169 (179)
Inferring Patterns in Mitochondrial DNA Sequences Through Hypercube Independent Spanning Trees
Computers in Biology and Medicine, 2016 Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)Given a graph G, a set of spanning trees rooted at a ...
Helio Pedrini
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
Two Counterexamples on Completely Independent Spanning Trees
Discrete Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +4 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
Theoretical Computer Science, 2022Edge-independent spanning trees (for short EISTs) have widespread applications in fault-tolerance to enhance stability and security of networks, as well as in IP fast rerouting to prevent network breakdown caused by link failure. Then, the algorithms for constructing EISTs on many classes of graphs have been investigated.
Huanwen Zhang +3 more
openaire +3 more sources
A Hamilton Sufficient Condition for Completely Independent Spanning Tree
Discrete Applied Mathematics, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hong Xia
exaly +3 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 +3 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 +2 more sources
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
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