Results 51 to 60 of about 49,235 (305)
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
Reconfiguration of non-crossing spanning trees
Journal of Computational GeometryFor a set $P$ of $n$ points in the plane in general position, a non-crossing spanning tree is a spanning tree of the points where every edge is a straight-line segment between a pair of points and no two edges intersect except at a common endpoint.
Oswin Aichholzer +10 more
doaj +1 more source
Spanning Trails and Spanning Trees
, 2019 There are two major parts in my dissertation. One is based on spanning trail, the other one is comparing spanning tree packing and covering.;The results of the spanning trail in my dissertation are motivated by Thomassen\u27s Conjecture that every 4 ...
Zhang, Meng
openaire +4 more sources
Spanning trees with generalized degree constraints arising in the design of wireless networks
, 2011 In this paper we describe a minimum spanning tree problem with generalized degree constraints which arises in the design of wireless networks. The signal strength on the receiver side of a wireless link decreases with the distance between transmitter and
Luís Gouveia +5 more
core +1 more source
Number of Spanning Trees of Cartesian and Composition Products of Graphs and Chebyshev Polynomials
IEEE Access, 2019 Enumerating all the spanning trees of a graph without duplication is one of the widely studied problems in electrical engineering and computer science literature.
S. N. Daoud
doaj +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
Non-crossing trees revisited: cutting down and spanning subtrees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 Here we consider two parameters for random non-crossing trees: $\textit{(i)}$ the number of random cuts to destroy a size-$n$ non-crossing tree and $\textit{(ii)}$ the spanning subtree-size of $p$ randomly chosen nodes in a size-$n$ non-crossing tree ...
Alois Panholzer
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