Results 21 to 30 of about 3,689,343 (292)

Degree-Constrained k-Minimum Spanning Tree Problem

open access: yesComplexity, 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

The Spanning Tree of a Divisible Multiple Graph

open access: yesМоделирование и анализ информационных систем, 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

On the probabilistic min spanning tree Problem [PDF]

open access: yes, 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

Isolation Forest Based on Minimal Spanning Tree

open access: yesIEEE Access, 2022
Detecting anomalies in data sets has been one of the most studied issues in modern data analysis. Therefore, there is a plethora of applications in a very wide range of fields of science and technology.
Lukasz Galka   +2 more
doaj   +1 more source

Degree Sum Condition for the Existence of Spanning k-Trees in Star-Free Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2022
For an integer k ≥ 2, a k-tree T is defined as a tree with maximum degree at most k. If a k-tree T spans a graph G, then T is called a spanning k-tree of G.
Furuya Michitaka   +5 more
doaj   +1 more source

PENYELESAIAN MASALAH TRANSPORTASI UNTUK MENCARI SOLUSI OPTIMAL DENGAN PENDEKATAN MINIMUM SPANNING TREE (MST) MENGGUNAKAN ALGORITMA KRUSKAL DAN ALGORITMA PRIM

open access: yesKubik, 2021
Penelitian ini membahas tentang penyelesaian masalah transportasi dengan pendekatan Minimum Spanning Tree (MST) menggunakan algoritma Kruskal dan algoritma Prim untuk mencari solusi optimal.
Yusufiani Nurlinawati Dili   +2 more
doaj   +1 more source

Global field observations of tree die-off reveal hotter-drought fingerprint for Earth’s forests

open access: yesNature Communications, 2022
Earth’s forests face grave challenges in the Anthropocene, including hotter droughts increasingly associated with widespread forest die-off events. But despite the vital importance of forests to global ecosystem services, their fates in a warming world ...
W. Hammond   +9 more
semanticscholar   +1 more source

Generalized minimum spanning tree games

open access: yesEURO Journal on Computational Optimization, 2016
The minimum-cost spanning tree game is a special class of cooperative games defined on a graph with a set of vertices and a set of edges, where each player owns a vertex. Solutions of the game represent ways to distribute the total cost of a minimum-cost
PhuocHoang Le   +2 more
doaj   +1 more source

The normalized Laplacian, degree-Kirchhoff index and the spanning tree numbers of generalized phenylenes

open access: yesDiscrete Applied Mathematics, 2019
Recently, Peng and Li (2017) derived an explicit closed formula of Kirchhoff index and the number of spanning trees of linear phenylenes and their dicyclobutadieno derivatives, respectively in terms of the Laplacian spectrum.
Zhongxun Zhu, Jia-Bao Liu
semanticscholar   +1 more source

Implementasi VLAN dan Spanning Tree Protocol Menggunakan GNS 3 dan Pengujian Sistem Keamanannya

open access: yesKhazanah Informatika, 2018
Pada saat ini, jaringan komputer telah banyak digunakan dalam berbagai macam bidang dan telah mengalami perkembangan yang sangat pesat. Hampir setiap perusahaan atau organisasi menggunakan jaringan komputer.
Wahyu Saputra, Fajar Suryawan
doaj   +1 more source

Home - About - Disclaimer - Privacy