Results 21 to 30 of about 227,714 (275)
Discrete Mathematics, 1992 AbstractWe prove a best possible lower bound for the number of isomorphism classes into which all rooted spanning trees of a rooted cactus partition. We announce a best possible lower bound for the number of isomorphism classes into which all spanning trees of a cactus partition.
Vestergaard, Preben Dahl, Egawa, Y.
openaire +3 more sources
On the probabilistic min spanning tree Problem [PDF]
, 2010 We study a probabilistic optimization model for min spanning tree, where any vertex vi of the input-graph G(V,E) has some presence probability pi in the final instance G′ ⊂ G that will effectively be optimized.
A Prekopa +27 more
core +5 more sources
The Spanning Tree of a Divisible Multiple Graph
Моделирование и анализ информационных систем, 2018 In this paper, we study undirected multiple graphs of any natural multiplicity k > 1. There are edges of three types: ordinary edges, multiple edges and multi-edges.
Alexander V. Smirnov
doaj +1 more source
Involve, a Journal of Mathematics, 2009 The minimum spanning tree problem originated in the 1920s when O. Borůvka identified and solved the problem during the electrification of Moravia. This graph theory problem and its numerous applications have inspired many others to look for alternate ways of finding a spanning tree of minimum weight in a weighted, connected graph since Borůvka’s time ...
Jayawant, Pallavi, Glavin, Kerry
openaire +2 more sources
Degree-Constrained k-Minimum Spanning Tree Problem
Complexity, 2020 Let GV,E be a simple undirected complete graph with vertex and edge sets V and E, respectively. In this paper, we consider the degree-constrained k-minimum spanning tree (DCkMST) problem which consists of finding a minimum cost subtree of G formed with ...
Pablo Adasme, Ali Dehghan Firoozabadi
doaj +1 more source
Brain Tumor Segmentation Based on Minimum Spanning Tree
Frontiers in Signal Processing, 2022 In this paper, we propose a minimum spanning tree-based method for segmenting brain tumors. The proposed method performs interactive segmentation based on the minimum spanning tree without tuning parameters.
Simeon Mayala +9 more
doaj +1 more source
Computational Geometry, 2014 Two plane geometric graphs are said to be compatible when their union is a plane geometric graph. Let S be a set of n points in the Euclidean plane in general position and let T be any given plane geometric spanning tree of S. In this work, we study the problem of finding a second plane geometric tree T' spanning S, such that is compatible with T and ...
Garcia Olaverri, Alfredo Martin +3 more
openaire +4 more sources
Spanning Trees and bootstrap reliability estimation in correlation based networks [PDF]
, 2006 We introduce a new technique to associate a spanning tree to the average linkage cluster analysis. We term this tree as the Average Linkage Minimum Spanning Tree.
Anderberg M. R. +10 more
core +2 more sources
Reliable Route Selection for Wireless Sensor Networks with Connection Failure Uncertainties
Sensors, 2021 For wireless sensor networks (WSN) with connection failure uncertainties, traditional minimum spanning trees are no longer a feasible option for selecting routes.
Jianhua Lyu +3 more
doaj +1 more source
MENCARI MINIMUM SPANNING TREE DENGAN KONSTREN
Jurnal Matematika UNAND, 2019 Misalkan G = (V, E) adalah graf tak berarah terhubung yang bukan tree, berarti di G terdapat cycle. Dengan cyclic interchange maka diperoleh subgraf T yang tidak memuat cycle. Subgraf T inilah yang dinamakan dengan spanning tree.
Miftahul Jannah +2 more
doaj +1 more source