Results 241 to 250 of about 139,243 (275)
Some of the next articles are maybe not open access.
Independent spanning trees on even networks
Information Sciences, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kim, Jong-Seok +3 more
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.
Lin J.-C. +3 more
openaire +2 more sources
Two Completely Independent Spanning Trees of $$P_4$$-Free Graphs
Graphs and Combinatorics, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Xiaodong +2 more
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
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, Takao Nishizeki
openaire +1 more source
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.
Obokata, Koji +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.
Hong, Xia, Liu, Qinghai
openaire +1 more source
Independent subspace analysis using geodesic spanning trees
Proceedings of the 22nd international conference on Machine learning - ICML '05, 2005A novel algorithm for performing Independent Subspace Analysis, the estimation of hidden independent subspaces is introduced. This task is a generalization of Independent Component Analysis. The algorithm works by estimating the multi-dimensional differential entropy. The estimation utilizes minimal geodesic spanning trees matched to the sample points.
Barnabás Póczos, András Lõrincz
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 +1 more source
Independent Spanning Trees on Special BC Networks
Applied Mechanics and Materials, 2012There is a well-known conjecture on independent spanning trees (ISTs) on graphs: For any n-connected graph G with n≥1, there are n ISTs rooted at an arbitrary node on G. It still remains open for n≥5. We propose an integrated algorithm to construct n ISTs rooted at any node similar to 0 or 10n-1 on n-dimensional HCH cube for n≥1 and give the ...
Bao Lei Cheng +4 more
openaire +1 more source