Results 81 to 90 of about 477,458 (300)
Minimum Edge Cuts in Diameter 2 Graphs
Discussiones Mathematicae Graph Theory, 2019 Plesnik proved that the edge connectivity and minimum degree are equal for diameter 2 graphs. We provide a streamlined proof of this fact and characterize the diameter 2 graphs with a nontrivial minimum edge cut.
Bickle Allan, Schwenk Allen
doaj +1 more source
Minimum cuts in near-linear time [PDF]
Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96, 1996 We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree packings combined with our previously developed random sampling techniques. We give a randomized (Monte Carlo) algorithm that finds a minimum cut in an m
openaire +2 more sources
Protein pyrophosphorylation by inositol pyrophosphates — detection, function, and regulation
FEBS Letters, EarlyView.Protein pyrophosphorylation is an unusual signaling mechanism that was discovered two decades ago. It can be driven by inositol pyrophosphate messengers and influences various cellular processes. Herein, we summarize the research progress and challenges of this field, covering pathways found to be regulated by this posttranslational modification as ...
Sarah Lampe +3 more
wiley +1 more source
Study on Tool Deterioration in Machining with Minimum Quantity Lubrication (MQL) Condition
Teknik, 2020 This study aims to observe the tool deterioration following application of minimum quantity lubrication method (MQL). The designed MQL system is completed with an Arduino controller system which was able to be either manually-controlled or automatically ...
Rika Dwi Hidayatul Qoryah +2 more
doaj +1 more source
Discrete Applied Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
FEBS Letters, EarlyView.The Ile181Asn variant of human UDP‐xylose synthase (hUXS1), associated with a short‐stature genetic syndrome, has previously been reported as inactive. Our findings demonstrate that Ile181Asn‐hUXS1 retains catalytic activity similar to the wild‐type but exhibits reduced stability, a looser oligomeric state, and an increased tendency to precipitate ...
Tuo Li +2 more
wiley +1 more source
Robust Branch-Cut-and-Price for the Capacitated Minimum Spanning Tree Problem over a Large Extended Formulation [PDF]
This paper presents a robust branch-cut-and-price algorithm for the Capacitated Minimum Spanning Tree Problem (CMST). The variables are associated to q-arbs, a structure that arises from a relaxation of the capacitated prize-collecting arbores- cence ...
Pessoa, Artur +5 more
core
FEBS Letters, EarlyView.We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee +3 more
wiley +1 more source
Analysis of Tooth Surface Envelope Forming and Top-cut of Face Gear
Jixie chuandong, 2017 In order to explicitly solve the tooth surface model of forming face gear,and exactly solve the minimum inner radius of face gear with top-cut. The orthogonal face gear envelope coordinate system is established and the tooth surface equation of ...
Feng Zhanrong +3 more
doaj
On Minimum Depth of Cut in nanomachining
, 2010 The concept of Minimum Depth of Cut (MDC) is that the depth of cut must be over a certain critical thickness before any chip is formed. It is actually a major limiting factor on achievable accuracy in nanomachining, because the generated surface ...
Oluwajobi, Akinjide O., Chen, Xun
core