Results 41 to 50 of about 41,748 (161)

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

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

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

Efficient Maintenance of Minimum Spanning Trees in Dynamic Weighted Undirected Graphs

Mathematics
This paper presents an algorithm for effectively maintaining the minimum spanning tree in dynamic weighted undirected graphs. The algorithm efficiently updates the minimum spanning tree when the underlying graph structure changes.
Mao Luo, Huigang Qin, Xinyun Wu, Caiquan Xiong, Dahai Xia, Yuanzhi Ke   +5 more
doaj   +1 more source

Cross Decomposition of the Degree-Constrained Minimum Spanning Tree problem [PDF]

Journal of Systemics, Cybernetics and Informatics, 2007
As computer communication networks become a prevalent part in our daily life, the importance of efficient design of those networks becomes more evident.
Han-Suk Sohn, Dennis Bricker
doaj  

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

Planar bichromatic minimum spanning trees

Journal of Discrete Algorithms, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Magdalene G. Borgelt, Marc J. van Kreveld, Maarten Löffler, Jun Luo 0008, Damian Merrick, Rodrigo I. Silveira, Mostafa Vahedi   +6 more
openaire   +8 more sources

Minimum Monotone Spanning Trees

Given a finite set $S$ of points in the plane and a finite set $\mathcal{D}$ of directions, a geometric spanning tree~$T$ of~$S$ is $\mathcal{D}$-monotone if every path in $T$ is monotone with respect to some direction in $\mathcal{D}$. We study the problem of computing, for a given point set $S$ and a given set $\mathcal{D}$ of directions, a minimum ...
Emilio Di Giacomo, Walter Didimo, Eleni Katsanou, Lena Schlipf, Antonios Symvonis, Alexander Wolff 0001   +5 more
openaire   +5 more sources

A novel approach for constructing a minimum spanning tree

Journal of Nigerian Society of Physical Sciences
The spanning tree of a graph is obtained when all vertices of a graph are connected in such a way that no cycle is formed. This work proposes a new algorithm that, at each round, selects a maximal independent set of vertices (an inclusion-maximal, not ...
Haribhau R. Bhapkar, Rezwan Ul Shaban, Shabir Ahmad Mir, Junaid Nisar   +3 more
doaj   +1 more source

Minimum Spanning Trees and Types of Dissimilarities

European Journal of Combinatorics, 1996
The author surveys and brings together a set of observations concerning dissimilarities, i.e., functions \(d\): \(X^2 \to [0, \infty)\) such that \(d(x,x) = 0\) and such that \(d(x,y) = d(y,x)\), and dissimilarity preorders \(R\) (reflexive and transitive relations) on \(X^2\), \(X\) a finite set, with the emphasis on compatibility relationships which ...
openaire   +2 more sources