Results 31 to 40 of about 49,235 (305)
On the probabilistic min spanning tree Problem [PDF]
, 2010 International audienceWe study a probabilistic optimization model for min spanning tree, where any vertex v i of the input-graph G(V, E) has some presence probability p i in the final instance G′ ⊂ G that will effectively be optimized.
Paschos, V.T. +10 more
core +1 more source
Spanning Trees Minimizing Branching Costs [PDF]
Discrete Mathematics & Theoretical Computer ScienceThe Minimum Branch Vertices Spanning Tree problem aims to find a spanning tree $T$ in a given graph $G$ with the fewest branch vertices, defined as vertices with a degree three or more in $T$.
Luisa Gargano, Adele A. Rescigno
doaj +1 more source
Constructing Independent Spanning Trees on Transposition Networks
IEEE Access, 2020 In interconnection networks, data distribution and fault tolerance are crucial services. This study proposes an effective algorithm for improving connections between networks.
Chien-Fu Lin +2 more
doaj +1 more source
Note: Sharp Upper and Lower Bounds on the Number of Spanning Trees in Cartesian Product of Graphs
Discussiones Mathematicae Graph Theory, 2013 Let G1 and G2 be simple graphs and let n1 = |V (G1)|, m1 = |E(G1)|, n2 = |V (G2)| and m2 = |E(G2)|. In this paper we derive sharp upper and lower bounds for the number of spanning trees τ in the Cartesian product G1 □G2 of G1 and G2. We show that: and .
Azarija Jernej
doaj +1 more source
Simultaneously dominating all spanning trees of a graph
Electronic Journal of Graph Theory and Applications, 2022 We investigate the problem of simultaneously dominating all spanning trees of a given graph. We prove that on 2-connected graphs, a subset of the vertices dominates all spanning trees of the graph if and only if it is a vertex cover.
Sebastian Johann +2 more
doaj +1 more source
On the Longest Spanning Tree with Neighborhoods [PDF]
Discrete Mathematics, Algorithms and Applications, 2018 We study a maximization problem for geometric network design. Given a set of [Formula: see text] compact neighborhoods in [Formula: see text], select a point in each neighborhood, so that the longest spanning tree on these points (as vertices) has maximum length. Here, we give an approximation algorithm with ratio [Formula: see text], which represents
Ke Chen 0011, Adrian Dumitrescu
openaire +2 more sources
Completely Independent Spanning Trees in (Partial) k-Trees
Discussiones Mathematicae Graph Theory, 2015 Two 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.
Matsushita Masayoshi +2 more
doaj +1 more source
Spanning Trees—Short or Small [PDF]
SIAM Journal on Discrete Mathematics, 1996 We study the problem of finding small trees. Classical network design problems are considered with the additional constraint that only a specified number $k$ of nodes are required to be connected in the solution. A prototypical example is the $k$MST problem in which we require a tree of minimum weight spanning at least $k$ nodes in an edge-weighted ...
R. Ravi 0001 +4 more
openaire +3 more sources
Construction Algorithm of Completely Independent Spanning Tree in Dragonfly Network [PDF]
Jisuanji kexue, 2022 Dragonfly network,proposed by Kim et al.,is a topology for high-performance computer systems.In dragonfly network,compute nodes are attached to switches,the switches are organized into groups,and the network is organized as a two-level clique.There is a ...
BIAN Qing-rong, CHENG Bao-lei, FAN Jian-xi, PAN Zhi-yong
doaj +1 more source