Maximum Flows

2003 ◽  
pp. 46-62
Author(s):  
David K. Smith
Keyword(s):  
Maximum Flows

Tidal Flow: A Fast and Teachable Maximum Flow Algorithm

2018 ◽  
Vol 12 ◽  
pp. 25-41
Author(s):  
Matthew C. FONTAINE
Keyword(s):  
Computer Science ◽  
Tidal Flow ◽  
Maximum Flow ◽  
Efficient Algorithms ◽  
Science Students ◽  
Flow Algorithm ◽  
Maximum Flows

Among the most interesting problems in competitive programming involve maximum flows. However, efficient algorithms for solving these problems are often difficult for students to understand at an intuitive level. One reason for this difficulty may be a lack of suitable metaphors relating these algorithms to concepts that the students already understand. This paper introduces a novel maximum flow algorithm, Tidal Flow, that is designed to be intuitive to undergraduate andpre-university computer science students.

Restricted Constraints in the Problem of Maximum Attainable Flow in Minimum Cost in a Network

2015 ◽  
Vol 3 (2) ◽  
Author(s):  
Nazimuddin Ahmed ◽  
Shobha Duttadeka
Keyword(s):  
Minimum Cost ◽  
Optimal Route ◽  
Precedence Relation ◽  
Flow Capacity ◽  
Cost Distance ◽  
Realistic Situation ◽  
Maximum Flows

In this paper we have considered a version of restricted constraints in the problem of maximum attainable flow (capacity) in minimum cost (distance) in a network (Ahmed, Das, & Purusotham, 2012b). By restricted constraints one means that the link(s) (cities or stations or nodes) are completed (or visited) in such a way that a particular link is to be preceded (completed or visited) by another link (precedence relation need not be immediate). Here the aim is to obtained an optimal route of a more realistic situation as to scheduling a restricted constraints to a maximum flows at a minimum cost from a source to a destination. The distance (cost) and arc capacity between any two stations are given.

Computer algorithms

2018 ◽  
Author(s):  
Mark Newman
Keyword(s):  
Data Structures ◽  
Analysis Of Algorithms ◽  
Shortest Paths ◽  
Minimum Cut ◽  
Network Data ◽  
Computer Algorithms ◽  
Breadth First Search ◽  
Augmenting Path ◽  
Basic Concepts ◽  
Maximum Flows

This chapter introduces some of the fundamental concepts of numerical network calculations. The chapter starts with a discussion of basic concepts of computational complexity and data structures for storing network data, then progresses to the description and analysis of algorithms for a range of network calculations: breadth-first search and its use for calculating shortest paths, shortest distances, components, closeness, and betweenness; Dijkstra's algorithm for shortest paths and distances on weighted networks; and the augmenting path algorithm for calculating maximum flows, minimum cut sets, and independent paths in networks.

scholarly journals Assessing Climatic Drivers of Spring Mean and Annual Maximum Flows in Western Canadian River Basins

Water ◽  
2021 ◽  
Vol 13 (12) ◽  
pp. 1617
Author(s):  
Yonas B. Dibike ◽  
Rajesh R. Shrestha ◽  
Colin Johnson ◽  
Barrie Bonsal ◽  
Paulin Coulibaly
Keyword(s):  
Snow Water Equivalent ◽  
Climate Model ◽  
Regional Climate ◽  
River Basins ◽  
Snow Accumulation ◽  
Spatial Variations ◽  
Annual Maximum ◽  
Spring Precipitation ◽  
Average Maximum ◽  
Maximum Flows

Flows originating from cold and mountainous watersheds are highly dependent on temperature and precipitation patterns, and the resulting snow accumulation and melt conditions, affecting the magnitude and timing of annual peak flows. This study applied a multiple linear regression (MLR) modelling framework to investigate spatial variations and relative importance of hydroclimatic drivers of annual maximum flows (AMF) and mean spring flows (MAMJflow) in 25 river basins across western Canada. The results show that basin average maximum snow water equivalent (SWEmax), April 1st SWE and spring precipitation (MAMJprc) are the most important predictors of both AMF and MAMJflow, with the proportion of explained variance averaging 51.7%, 44.0% and 33.5%, respectively. The MLR models’ abilities to project future changes in AMF and MAMJflow in response to changes to the hydroclimatic controls are also examined using the Canadian Regional Climate Model (CanRCM4) output for RCP 4.5 and RCP8.5 scenarios. The results show considerable spatial variations depending on individual watershed characteristics with projected changes in AMF ranging from −69% to +126% and those of MAMJflow ranging from −48% to +81% by the end of this century. In general, the study demonstrates that the MLR framework is a useful approach for assessing the spatial variation in hydroclimatic controls of annual maximum and mean spring flows in the western Canadian river basins. However, there is a need to exercise caution in applying MLR models for projecting changes in future flows, especially for regulated basins.

scholarly journals Spatial development of hydrological droughts in lake catchments

2019 ◽  
Vol 19 (4) ◽  
pp. 159-174
Author(s):  
Malwina Kozek ◽  
Edmund Tomaszewski
Keyword(s):  
Spatial Development ◽  
Hydrological Drought ◽  
Stream Network ◽  
Area Increase ◽  
Daily Discharge ◽  
Maximum Flows ◽  
Balance Structure ◽  
Lake Systems ◽  
Hydrological Droughts ◽  
Basin Area

AbstractIn river-lake systems, reservoirs significantly affect the formation of water resources in the catchment by reducing the maximum flows and floods as well as increasing the low flows. In lake catchments, the pace of hydrological drought progression is usually slow. However, this phenomenon can be very extreme and destructive for water balance structure as a result of the very slow renewal rate of catchment resources. An estimation of hydrological drought development was conducted in the Biebrza river catchment (6,900 km2) on the basis of a daily discharge series for 18 water-gauge stations in the period 1982–2014. The number and location of the gauges allowed reliable results of the spatial pattern of drought to be obtained. The main objective of the research was the construction and assessment of the applicability of indicators which are estimators of drought spatial progression. Comparative analysis of four proposed indices led to two of them being recommended. These characteristics estimate the direction of drought development according to the stream network hierarchy, location of sub-catchments and the direction of river basin area increase. As a result, determinants of the spatial development of hydrological drought as well as its importance in the hydrographical structure were identified. Furthermore, the intensity of drought was evaluated and all investigated indices were applied to a time series analysis.

scholarly journals Trends in the Maximum, Mean, and Low Flows of Turkish Rivers

2005 ◽  
Vol 6 (3) ◽  
pp. 280-290 ◽  
Author(s):  
H. K. Cigizoglu ◽  
M. Bayazit ◽  
B. Önöz
Keyword(s):  
Trend Analysis ◽  
Kendall Test ◽  
T Test ◽  
Precipitation Trend ◽  
Annual Maximum ◽  
Low Flows ◽  
Time Period ◽  
Southern Turkey ◽  
The Mean ◽  
Maximum Flows

Abstract In this study the existence of trend in maximum, mean, and low flows of Turkish rivers has been investigated. The data consisted of the daily mean flows of nearly 100 flow stations in 24 hydrological regions of Turkey. Trend analysis has been carried out using the parametric t test and nonparametric τ (Mann–Kendall) test. Both tests have been applied to annual maximum, mean, 1-day, and 7-day low flows. Trend existence was detected in the majority of rivers in western and southern Turkey and in some parts of central and eastern Turkey. Trends in mean and low flows were more common compared with maximum flows. Except at a few stations, flows showed a decreasing trend. In the time period of the last 30–60 yr, statistically significant decrease was found especially in the mean and low flows (and in some of the maximum flows) in western, central, and southern parts of Turkey. Such trends were not observed in other regions. These results are in agreement with those of the precipitation trend studies in Turkey.

Sign in / Sign up

Export Citation Format

Share Document