Results 41 to 50 of about 248,790 (377)
Spanning trees with small diameters
AKCE International Journal of Graphs and Combinatorics, 2020 A spanning tree with small diameter of a graph has many applications. In this paper we first make the following conjecture and show that the condition is best possible if it is true. If a connected graph satisfies , then has a spanning tree with diameter
Mikio Kano, Hajime Matsumura
doaj +1 more source
Minimum Restricted Diameter Spanning Trees [PDF]
Discrete Applied Mathematics, 2002 AbstractLet G=(V,E) be a requirement graph. Let d=(dij)i,j=1n be a length metric. For a tree T denote by dT(i,j) the distance between i and j in T (the length according to d of the unique i−j path in T). The restricted diameter of T, DT, is the maximum distance in T between pair of vertices with requirement between them. The minimum restricted diameter
Asaf Levin, Refael Hassin
openaire +2 more sources
Advanced Materials Interfaces, EarlyView., 2023 This review discusses the use of Surface‐Enhanced Raman Spectroscopy (SERS) combined with Artificial Intelligence (AI) for detecting antimicrobial resistance (AMR). Various SERS studies used with AI techniques, including machine learning and deep learning, are analyzed for their advantages and limitations.
Zakarya Al‐Shaebi +4 more
wiley +1 more source
Extensions of the minimum labelling spanning tree problem
Journal of Telecommunications and Information Technology, 2006 In this paper we propose some extensions of the minimum labelling spanning tree problem. The main focus is on the minimum labelling Steiner tree problem: given a graph G with a color (label) assigned to each edge, and a subset Q of the nodes of G (basic
Raffaele Cerulli +2 more
doaj +1 more source
Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model [PDF]
Distributed computing, 2018 We provide the first asynchronous distributed algorithms to compute broadcast and minimum spanning tree with o(m) bits of communication, in a sufficiently dense graph with n nodes and m edges.
A. Mashreghi, Valerie King
semanticscholar +1 more source
The Minimum-Area Spanning Tree Problem [PDF]
Computational Geometry, 2005 AbstractMotivated by optimization problems in sensor coverage, we formulate and study the Minimum-Area Spanning Tree (mast) problem: Given a set P of n points in the plane, find a spanning tree of P of minimum “area”, where the area of a spanning tree T is the area of the union of the n−1 disks whose diameters are the edges in T.
Paz Carmi +2 more
openaire +2 more sources
A MINIMUM SPANNING TREE BASED METHOD FOR UAV IMAGE SEGMENTATION [PDF]
ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2016 This paper proposes a Minimum Span Tree (MST) based image segmentation method for UAV images in coastal area. An edge weight based optimal criterion (merging predicate) is defined, which based on statistical learning theory (SLT).
P. Wang, Z. Wei, W. Cui, Z. Lin
doaj +1 more source
Minimum-Spanning-Tree-Based Time Delay Estimation Robust to Outliers
IEEE Access, 2023 In this paper, we present a novel approach to estimating multiple time delays (TDs) in sensor arrays that is robust to outliers of TD measurements. These measurements are typically obtained from the peak of the cross correlation of two sensor signals but
Kouei Yamaoka +3 more
doaj +1 more source
On Sorting, Heaps, and Minimum Spanning Trees [PDF]
Algorithmica, 2010 Let A be a set of size m. Obtaining the first k≤m elements of A in ascending order can be done in optimal O(m+klog k) time. We present Incremental Quicksort (IQS), an algorithm (online on k) which incrementally gives the next smallest element of the set, so that the first k elements are obtained in optimal expected time for any k.
Navarro, Gonzalo, Paredes, Rodrigo
openaire +4 more sources
Planar bichromatic minimum spanning trees
Journal of Discrete Algorithms, 2009 AbstractGiven a set S of n red and blue points in the plane, a planar bichromatic minimum spanning tree is the shortest possible spanning tree of S, such that every edge connects a red and a blue point, and no two edges intersect. We show that computing this tree is NP-hard in general. For points in convex position, a cubic-time algorithm can be easily
Marc van Kreveld +6 more
openaire +7 more sources