Results 71 to 80 of about 1,124,505 (266)

On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow

open access: yesJournal of Graph Algorithms and Applications, 2020
Given a graph $G=(V,E)$ with two distinguished vertices $s,t\in V$ and an integer $L$, an $L$-bounded flow is a flow between $s$ and $t$ that can be decomposed into paths of length at most $L$. In the maximum $L$-bounded flow problem the task is to find
Kateřina Altmanová   +2 more
doaj   +1 more source

Playing with the Maximum-Flow Problem

open access: yesEPiC Series in Computing, 2018
In the traditional maximum-flow problem, the goal is to transfer maximum flow in a network by directing, in each vertex in the network, incoming flow into outgoing edges. The problem has been extensively used in order to optimize the performance of networks in numerous application areas.
openaire   +2 more sources

On the history of the transportation and maximum flow problems [PDF]

open access: yesMathematical Programming, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +4 more sources

Hyperosmotic stress induces PARP1‐mediated HPF1‐dependent mono(ADP‐ribosyl)ation

open access: yesFEBS Letters, EarlyView.
Sorbitol‐induced hyperosmotic stress rapidly induces reversible mono(ADP‐ribosyl)ation (MARylation) on PARP1 without the signs of genotoxic signaling. We show that PARP1 autoMARylation is HPF1 dependent and forms hydroxylamine‐resistant O‐glycosidic linkages.
Anna Georgina Kopasz   +11 more
wiley   +1 more source

Salmonella lipopolysaccharide‐containing supported lipid bilayers as platforms to study bacteriophage interactions

open access: yesFEBS Letters, EarlyView.
We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace   +6 more
wiley   +1 more source

Phosphoinositides and inositol phosphates as molecular glues

open access: yesFEBS Letters, EarlyView.
Inositol phosphates (IPs) and phosphoinositides (PIPs) regulate diverse eukaryotic processes. Beyond recruiting signaling proteins or acting as structural cofactors, recent studies suggest they mediate protein–protein interactions as natural molecular glues.
Aleshia Seaton‐Terry   +9 more
wiley   +1 more source

ON THE EXPANSION OF THE WAREHOUSE BASE IN THE CONSIDERED ECONOMIC AREA WITH PARALLEL DETERMINATION OF THE OPTIMAL LOGISTICS WORK

open access: yesВестник Северо-Кавказского федерального университета, 2022
This article proposes a comprehensive solution of three linear programming problems: Transport problem (logistics problem), Maximum flow problem, Center allocation problem.
R. Rogulin   +5 more
doaj  

Inverse Generalized Maximum Flow Problems

open access: yesMathematics, 2019
A natural extension of maximum flow problems is called the generalized maximum flow problem taking into account the gain and loss factors for arcs. This paper investigates an inverse problem corresponding to this problem. It is to increase arc capacities
Javad Tayyebi, Adrian Deaconu
doaj   +1 more source

Three phosphatase families form a community: The phosphohydrolases that act upon inositol pyrophosphates

open access: yesFEBS Letters, EarlyView.
Inositol pyrophosphates are energy‐rich signaling molecules that perform critical functions in cells. Three different families of phosphatases hydrolyze the β phosphate of the inositol pyrophosphate molecules: two have narrow specificities and one is promiscuous.
Ronda J. Rolfes
wiley   +1 more source

Max-flow based load-balancing channel assignment algorithm for wireless mesh network

open access: yesTongxin xuebao, 2012
In view of the interference problem between channels and traffic flow load-balancing in wireless mesh networks,an objective optimization function for balancing network load was defined,and a load-balancing channel assignment algorithm based on maximum ...
Tao-shen LI, Ya-huan WEI, Zhi-hui GE
doaj  

Home - About - Disclaimer - Privacy