Results 31 to 40 of about 35,371 (162)

Minimum Spanning Tree for the Implementation of Kruskal’s Algorithm

IJID (International Journal on Informatics for Development), 2014
Kruskal’s algorithm is an algorithm used to find a minimum spanning tree in graph connectivity which gives an option to keep processing the edge limit with the least weight.
Paryati Paryati, Ahmad Subhan Yazid
doaj   +1 more source

Pruning a minimum spanning tree [PDF]

Physica A: Statistical Mechanics and its Applications, 2012
This work employs some techniques in order to filter random noise from the information provided by minimum spanning trees obtained from the correlation matrices of international stock market indices prior to and during times of crisis. The first technique establishes a threshold above which connections are considered affected by noise, based on the ...
openaire   +2 more sources

The Budgeted Labeled Minimum Spanning Tree Problem

Mathematics
In order to reduce complexity when designing multi-media communication networks, researchers often consider spanning tree problems defined on edge-labeled graphs.
Raffaele Cerulli, Ciriaco D'Ambrosio, Domenico Serra, Carmine Sorgente   +3 more
doaj   +1 more source

Object Tracking Using Sparsity Based Discriminative Minimum-Spanning-Tree

IEEE Access, 2019
An object tracking method based on a minimum-spanning-tree one-class classifier is proposed where the background is regarded as a collection of all other classes except the target.
Xin Man, Dun Mao, Xiaohong Lin, Fei Xia
doaj   +1 more source

Polynomial Time Approximation Schemes for the Constrained Minimum Spanning Tree Problem

Journal of Applied Mathematics, 2012
Let G=(V,E) be an undirected graph with a weight function and a cost function on edges. The constrained minimum spanning tree problem is to find a minimum cost spanning tree T in G such that the total weight in T is at most a given bound B. In this paper,
Yen Hung Chen
doaj   +1 more source

Planar bichromatic minimum spanning trees

Journal of Discrete Algorithms, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Borgelt, M.G., van Kreveld, M.J., Löffler, M., Luo, J., Merrick, D., Silveira, R.I., Vahedi, M.   +6 more
openaire   +7 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, Yiran Ren, Zeeshan Abbas, Baili Zhang   +3 more
doaj   +1 more source

Approximation theory in combinatorial optimization. Application to the generalized minimum spanning tree problem

Journal of Numerical Analysis and Approximation Theory, 2005
We present an overview of the approximation theory in combinatorial optimization. As an application we consider the Generalized Minimum Spanning Tree (GMST) problem which is defined on an undirected complete graph with the nodes partitioned into ...
Petrică C. Pop, G. Still, W. Kern
doaj   +2 more sources

Single-Valued Neutrosophic Minimum Spanning Tree and Its Clustering Method

Journal of Intelligent Systems, 2014
Clustering plays an important role in data mining, pattern recognition, and machine learning. Then, single-valued neutrosophic sets (SVNSs) are a useful means to describe and handle indeterminate and inconsistent information, which fuzzy sets and ...
Ye Jun
doaj   +1 more source

Evaluating the Minimum Spanning Trees Using Prim's Algorithm with Undirected Neutrosophic Graphs [PDF]

Neutrosophic Sets and Systems
This research paper presents an innovative approach for determining the minimum spanning tree (MST) in an undirected neutrosophic graph using Prim's Algorithm, which is extensively used in addressing network optimization problems.
Sukanta Ghadei, Amaresh Chandra Panada, Surapati Pramanik, Nihar Ranjan Panda, Prasanta Kumar Raut   +4 more
doaj   +1 more source