Results 31 to 40 of about 227,714 (275)
Isolation Forest Based on Minimal Spanning Tree
IEEE 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
On the Longest Spanning Tree with Neighborhoods [PDF]
Discrete Mathematics, Algorithms and Applications, 2018 We study a maximization problem for geometric network design. Given a set of [Formula: see text] compact neighborhoods in [Formula: see text], select a point in each neighborhood, so that the longest spanning tree on these points (as vertices) has maximum length. Here, we give an approximation algorithm with ratio [Formula: see text], which represents
Ke Chen, Adrian Dumitrescu
openaire +4 more sources
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
Discrete Mathematics, 2009 AbstractWe prove that every connected graph G of order n has a spanning tree T such that for every edge e of T the edge cut defined in G by the vertex sets of the two components of T−e contains at most n32 edges. This result solves a problem posed by Ostrovskii (M.I. Ostrovskii, Minimal congestion trees, Discrete Math. 285 (2004) 219–226).
Friedrich Regen +2 more
openaire +2 more sources
The number of spanning trees of a graph [PDF]
Journal of Inequalities and Applications, 2013 Abstract Let G be a simple connected graph of order n, m edges, maximum degree Δ 1 and minimum degree δ. Li et al. (Appl. Math. Lett. 23:286-290, 2010) gave an upper bound on number of spanning trees of a graph in terms of n, m,
Das, Kinkar C. +2 more
openaire +4 more sources
Implementasi VLAN dan Spanning Tree Protocol Menggunakan GNS 3 dan Pengujian Sistem Keamanannya
Khazanah 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
Enumeration for spanning trees and forests of join graphs based on the combinatorial decomposition
Electronic Journal of Graph Theory and Applications, 2016 This paper discusses the enumeration for rooted spanning trees and forests of the labelled join graphs $K_m+H_n$ and $K_m+K_{n,p}$, where $H_n$ is a graph with $n$ isolated vertices.
Sung Sik U
doaj +1 more source
Ramsey Spanning Trees and Their Applications [PDF]
ACM Transactions on Algorithms, 2018 The metric Ramsey problem asks for the largest subset S of a metric space that can be embedded into an ultrametric (more generally into a Hilbert space) with a given distortion. Study of this problem was motivated as a non-linear version of Dvoretzky theorem.
Michael Elkin +4 more
openaire +4 more sources
Streaming Complexity of Spanning Tree Computation [PDF]
, 2020 The semi-streaming model is a variant of the streaming model frequently used for the computation of graph problems. It allows the edges of an n-node input graph to be read sequentially in p passes using Õ(n) space.
+3 more
core +2 more sources
IET Computer Vision, 2020 Nowadays, a large number of deep convolutional neural network (CNN) models are applied to image classification tasks. However, the authors find that the most widely used evaluation indicator, the Top‐N Accuracy indicator, cannot discriminate these models
Yuntao Liu, Yong Dou, Peng Qiao
doaj +1 more source