Results 41 to 50 of about 94,026 (313)
Lower-Stretch Spanning Trees [PDF]
SIAM Journal on Computing, 2005 We prove that every weighted graph contains a spanning tree subgraph of average stretch O((log n log log n)^2). Moreover, we show how to construct such a tree in time O(m log^2 n).
Michael Elkin +3 more
openaire +2 more sources
Computational Geometry, 2014 Two plane geometric graphs are said to be compatible when their union is a plane geometric graph. Let S be a set of n points in the Euclidean plane in general position and let T be any given plane geometric spanning tree of S. In this work, we study the problem of finding a second plane geometric tree T' spanning S, such that is compatible with T and ...
Garcia Olaverri, Alfredo Martin +3 more
openaire +3 more sources
Estimating the weight of metric minimum spanning trees in sublinear time [PDF]
, 2008 In this paper we present a sublinear-time $(1+\varepsilon)$-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an $n$-point metric space. The running time of the algorithm is $\widetilde{\mathcal{O}}(n/\varepsilon^{\
Christian Sohler +3 more
core +1 more source
On encodings of spanning trees
Discrete Applied Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Spanning Trees and Spanners [PDF]
, 2000 We survey results in geometric network design theory, including algorithms for constructing minimum spanning trees and low-dilation graphs.
openaire +2 more sources
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christian Löwenstein +2 more
openaire +1 more source
Molecular Oncology, EarlyView.EXOSC10, an essential nuclear RNA exosome‐associated 3′‐5′ exoribonuclease, is inhibited by the anticancer drug 5‐fluorouracil (5‐FU), and EXOSC10 depletion increases 5‐FU sensitivity. The colon‐cancer variant EXOSC10S402T, located in a proteolysis motif, is stable and nuclear but nonfunctional in vivo.
Radhika Sain +10 more
wiley +1 more source
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
Interpreting the effects of DNA polymerase variants at the structural level
Molecular Oncology, EarlyView.Using MAVISp and molecular dynamics simulations, we analyzed over 60 000 missense variants in POLE and POLD1 from ClinVar, COSMIC, cBioPortal, and saturation mutagenesis. Identified mechanistic indicators, including stability, binding, and long‐range, enable structural interpretation, providing ACMG‐like evidence for possible reclassification of VUS ...
Matteo Arnaudi +7 more
wiley +1 more source
Fast reoptimization for the minimum spanning tree problem [PDF]
, 2010 We study reoptimization versions of the minimum spanning tree problem. The reoptimization setting can generally be formulated as follows: given an instance of the problem for which we already know some optimal solution, and given some “small ...
Paschos, Vangelis Th. +4 more
core +1 more source