Results 31 to 40 of about 1,228,420 (310)
Policy-Compliant Maximum Network Flows
Applied Sciences, 2019 Computer network administrators are often interested in the maximal bandwidth that can be achieved between two nodes in the network, or how many edges can fail before the network gets disconnected.
Pieter Audenaert +2 more
doaj +1 more source
Networks, 2020 AbstractIn 2013, Orlin proved that the max flow problem could be solved in O(nm) time. His algorithm ran in O(nm + m1.94) time, which was the fastest for graphs with fewer than n1.06 arcs. If the graph was not sufficiently sparse, the fastest running time was an algorithm due to King, Rao, and Tarjan.
James B. Orlin, Xiao-Yue Gong
openaire +4 more sources
A computational framework to emulate the human perspective in flow cytometric data analysis [PDF]
, 2012 Background: In recent years, intense research efforts have focused on developing methods for automated flow cytometric data analysis. However, while designing such applications, little or no attention has been paid to the human perspective that is ...
Surajit Ray (83793) +5 more
core +1 more source
SOME ASPECTS REGARDING THE MAXIMUM FLOW THE COLD SEASON IN THE UPPER PART OF THE BUZĂU RIVER CATCHMENT [PDF]
Aerul şi Apa: Componente ale Mediului, 2013 This article aims to analyze the maximum flow during the cold season (November 1st to April 30th), in the upper part of the Buzău river Catchment. The research took into account only those floods whose maximum discharges exceeded twice the multiannual ...
GABRIEL MINEA, VIOREL CHENDEŞ
doaj
Hydrology, 2022 Global projections of climate change indicate negative impacts on hydrological systems, with significant changes in precipitation and temperature in many parts of the world. As a result, floods and droughts are expected.
Edwin Pino-Vargas +5 more
doaj +1 more source
On maximum flows in polyhedral domains [PDF]
Proceedings of the fourth annual symposium on Computational geometry - SCG '88, 1988 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Design of poiseuille flow controllers using the method of inequalities [PDF]
, 2009 This paper investigates the use of the method of inequalities (MoI) to design output-feedback compensators for the problem of the control of instabilities in a laminar plane Poiseuille flow.
Whidborne, James F. +2 more
core +1 more source
Improved Maximum Flow Algorithm with Intersecting Vertices [PDF]
Jisuanji gongcheng, 2020 A hierarchical residual network constructed by the shortest augmented chain algorithm may lead to the loss of flow values when it faces multiple augmented chains with the same number of directed graphs and overlapped vertices,for it does not consider the
LUO Tiantian, ZHAO Lifeng
doaj +1 more source
Weakly and strongly polynomial algorithms for computing the maximum decrease in uniform arc capacities [PDF]
Yugoslav Journal of Operations Research, 2016 In this paper, a new problem on a directed network is presented. Let D be a feasible network such that all arc capacities are equal to U. Given a t > 0, the network D with arc capacities U - t is called the t-network.
Ghiyasvand Mehdi
doaj +1 more source
Approximation algorithm for maximum flow network interdiction problem [PDF]
Iranian Journal of Numerical Analysis and Optimization, 2020 We consider the maximum flow network interdiction problem. We provide a new interpretation of the problem and define a concept called ”optimalcut”.
M. Afsharirad
doaj +1 more source