Results 41 to 50 of about 1,228,420 (310)

A new approach to the maximum flow problem [PDF]

open access: yesProceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86, 1986
All previously known efficient maximum-flow algorithms work by finding augmenting paths, either one path at a time (as in the original Ford and Fulkerson algorithm) or all shortest-length augmenting paths at once (using the layered network approach of Dinic).
Andrew V. Goldberg, Robert Endre Tarjan
openaire   +2 more sources

Heterogeneity in the Global Practice of Central Nervous System Staging in Pediatric Acute Lymphoblastic Leukemia

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Central nervous system (CNS) involvement in childhood acute lymphoblastic leukemia (ALL) is assessed by cell counting and cytomorphology from cerebrospinal fluid (CSF) and is used for treatment stratification worldwide. The ratio of “CNS2” patients in clinical trials ranges from 3% to 40%, with unclear prognostic significance ...
Laura Almási   +14 more
wiley   +1 more source

New distance-directed algorithms for maximum flow and parametric maximum flow problems [PDF]

open access: yes, 1987
"July 1987."Bibliography: p. 34-36.Supported, in part, by the Presidential Young Investigator Grant of the National Science Foundation. 8451517-ECS Supported, in part, by a grant from Analog Devices, Apple Computer,Inc., and Prime Computer.J. B.

core  

A multi commodity flow model incorporating flow reduction functions

open access: yes, 2020
During the transmission of several different commodities from respective sources to the sinks, there may be loss due to leakage, evaporation, or damage. The generalized multi-commodity flow problem on a lossy network deals with the transshipment of these
Yarlagadda, Prasad K. D. V.   +3 more
core   +1 more source

Maximum skew-symmetric flows and matchings [PDF]

open access: yesMathematical Programming, 2004
35 pages, 3 figures, to appear in Mathematical Programming, minor stylistic corrections and shortenings to the original ...
Andrew V. Goldberg   +1 more
openaire   +3 more sources

Therapeutic Apheresis for Intravenous Methylprednisolone‐Refractory Neuromyelitis Optica Spectrum Disorder: Clinical and Radiological Outcomes in a Single‐Center Case Series

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Background Neuromyelitis optica spectrum disorder (NMOSD) is a relapsing autoimmune disease of the central nervous system. High‐dose intravenous methylprednisolone (IVMP) is the standard first‐line therapy for acute attacks, although some patients remain refractory.
Wataru Horiguchi   +5 more
wiley   +1 more source

Maximum Flows on Disjoint Paths [PDF]

open access: yes, 2010
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edge-disjoint paths? Equivalently, we wish to find a maximum weighted packing of disjoint paths, where the weight of a path is the minimum capacity of an edge on the path.
Guyslain Naves   +2 more
openaire   +1 more source

Effects of the Fluid Replacement Method During Online Hemodiafiltration on the Solute Removal Performance and Biocompatibility Using the Asymmetric Cellulose Triacetate Membrane

open access: yesTherapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Introduction Pre‐dilution online hemodiafiltration (Pre‐HDF) is predominantly used in Japan, whereas post‐dilution online HDF (Post‐HDF) is more common in Europe. An asymmetric cellulose triacetate (ATA) membrane may improve biocompatibility.
Kenji Sakurai   +4 more
wiley   +1 more source

Turbulent channel flow near maximum drag reduction: simulations, experiments and mechanisms

open access: yes, 2003
It is well known that the drag in a turbulent flow of a polymer solution is significantly reduced compared to Newtonian flow. Here we consider this phenomenon by means of a direct numerical simulation of a turbulent channel flow.
Hulsen, MA   +11 more
core   +1 more source

The Maximum Flow Problem for Oriented Flows.

open access: yes, 2016
In several applications of network flows, additional constraints have to be considered. In this paper, we study flows, where the flow particles have an orientation. For example, cargo containers with doors only on one side and train coaches with 1st and 2nd class compartments have such an orientation.
Stanley Schade, Martin Strehler 0001
openaire   +3 more sources

Home - About - Disclaimer - Privacy