Skip to search formSkip to main contentSkip to account menu

Flow network

Known as: Random networks, Flows, Generalized network 
In graph theory, a flow network (also known as a transportation network) is a directed graph where each edge has a capacity and each edge receives a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

49 relations
Approximate max-flow min-cut theoremBellman–Ford algorithmBiconnected graphBreadth-first search

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Photo-Realistic Single Image Super-Resolution Using a Generative Adversarial Network
Despite the breakthroughs in accuracy and speed of single image super-resolution using faster and deeper convolutional neural… 
Highly Cited
2016
Highly Cited
2016
Wide Residual Networks
Deep residual networks were shown to be able to scale up to thousands of layers and still have improving performance. However… 
Highly Cited
2011
Highly Cited
2011
Network Flows
1 Defining Network Flow A flow network is a directed graph G = (V,E) in which each edge (u, v) ∈ E has non-negative capacity c(u… 
Highly Cited
2011
Highly Cited
2011
Flows in Networks
In this chapter, you will see how the simplex method simplifies when it is applied to a class of optimization problems that are… 
Highly Cited
2008
Highly Cited
2008
Global data association for multi-object tracking using network flows
We propose a network flow based optimization method for data association needed for multiple object tracking. The maximum-a… 
Highly Cited
2003
Highly Cited
2003
Robust discrete optimization and network flows
Abstract.We propose an approach to address data uncertainty for discrete optimization and network flow problems that allows… 
Highly Cited
1996
Highly Cited
1996
Efficient Implementation of Weighted ENO Schemes
In this paper, we further analyze, test, modify, and improve the high order WENO (weighted essentially non-oscillatory) finite… 
Highly Cited
1975
Highly Cited
1975
Network Flow and Testing Graph Connectivity
An algorithm of Dinic for finding the maximum flow in a network is described. It is then shown that if the vertex capacities are… 
Highly Cited
1972
Highly Cited
1972
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem and the general minimum… 
Highly Cited
1956
Highly Cited
1956
NETWORK FLOW THEORY
Abstract : The labeling algorithm for the solution of maximal network flow problems and its application to various problems of… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)