Results 31 to 40 of about 248,790 (377)
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
Minimum spanning tree analysis for epilepsy magnetoencephalography (MEG) data
Exploration of Neuroprotective Therapy, 2023 Aim: Recently, brain network research is actively conducted through the application of graph theory. However, comparison between brain networks is subject to bias issues due to topological characteristics and heterogeneity across subjects.
Sunhan Shin, Chun Kee Chung, Jaehee Kim
doaj +1 more source
Minimum Spanning Trees on Random Networks [PDF]
Physical Review Letters, 2001 Physical Review ...
Phillip M. Duxbury, R. Dobrin
openaire +4 more sources
The generalized minimum spanning tree problem [PDF]
, 2000 We consider the Generalized Minimum Spanning Tree Problem denoted by GMSTP. It is known that GMSTP is NP-hard and even finding a near optimal solution is NP-hard.
Kern, W., Pop, P.C., Still, G.J.
core +9 more sources
Edge-Preserving Stereo Matching Using Minimum Spanning Tree
IEEE Access, 2019 Despite that the accuracy and efficiency of stereo matching technology have significantly improved in the past decades, the issue of edge-blurring remains a challenge to most of the existing approaches.
Congxuan Zhang +5 more
doaj +1 more source
A distributed algorithm for directed minimum-weight spanning tree
Distributed computing, 2021 In the directed minimum spanning tree problem (DMST, also called minimum weight arborescence ), we are given a directed weighted graph, and a root node r .
O. Fischer, R. Oshman
semanticscholar +1 more source
On Minimum Average Stretch Spanning Trees in Polygonal 2-trees [PDF]
, 2014 A spanning tree of an unweighted graph is a minimum average stretch spanning tree if it minimizes the ratio of sum of the distances in the tree between the end vertices of the graph edges and the number of graph edges.
Narayanaswamy, N. S., Ramakrishna, G.
core +1 more source
Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments
The Sea, 2020 We consider the minimum spanning tree (MST) problem in an uncertainty model where interval edge weights can be explored to obtain the exact weight. The task is to find an MST by querying the minimum number of edges.
Jacob Focke +2 more
semanticscholar +1 more source
Clustering of online learning resources via minimum spanning tree [PDF]
AAOU Journal, 2016 Purpose - The quick growth of web-based and mobile e-learning applications such as massive open online courses have created a large volume of online learning resources.
Qingyuan Wu +4 more
doaj +1 more source
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