Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,000,590 papers from all fields of science
Search
Sign In
Create Free Account
Flow network
Known as:
Random networks
, Flows
, Generalized network
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
49 relations
Approximate max-flow min-cut theorem
Bellman–Ford algorithm
Biconnected graph
Breadth-first search
Expand
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
C. Ledig
,
Lucas Theis
,
+6 authors
Wenzhe Shi
Computer Vision and Pattern Recognition
2016
Corpus ID: 211227
Despite the breakthroughs in accuracy and speed of single image super-resolution using faster and deeper convolutional neural…
Expand
Highly Cited
2016
Highly Cited
2016
Wide Residual Networks
Sergey Zagoruyko
,
N. Komodakis
British Machine Vision Conference
2016
Corpus ID: 15276198
Deep residual networks were shown to be able to scale up to thousands of layers and still have improving performance. However…
Expand
Highly Cited
2011
Highly Cited
2011
Network Flows
R. Ahuja
,
T. Magnanti
,
J. Orlin
2011
Corpus ID: 124023088
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…
Expand
Highly Cited
2011
Highly Cited
2011
Flows in Networks
E. Denardo
2011
Corpus ID: 58345825
In this chapter, you will see how the simplex method simplifies when it is applied to a class of optimization problems that are…
Expand
Highly Cited
2008
Highly Cited
2008
Global data association for multi-object tracking using network flows
Li Zhang
,
Yuan Li
,
R. Nevatia
IEEE Conference on Computer Vision and Pattern…
2008
Corpus ID: 32640
We propose a network flow based optimization method for data association needed for multiple object tracking. The maximum-a…
Expand
Highly Cited
2003
Highly Cited
2003
Robust discrete optimization and network flows
D. Bertsimas
,
Melvyn Sim
Mathematical programming
2003
Corpus ID: 1279073
Abstract.We propose an approach to address data uncertainty for discrete optimization and network flow problems that allows…
Expand
Highly Cited
1996
Highly Cited
1996
Efficient Implementation of Weighted ENO Schemes
Guang-Shan Jiang
,
Chi-Wang Shu
1996
Corpus ID: 14446714
In this paper, we further analyze, test, modify, and improve the high order WENO (weighted essentially non-oscillatory) finite…
Expand
Highly Cited
1975
Highly Cited
1975
Network Flow and Testing Graph Connectivity
S. Even
,
R. Tarjan
SIAM journal on computing (Print)
1975
Corpus ID: 43062446
An algorithm of Dinic for finding the maximum flow in a network is described. It is then shown that if the vertex capacities are…
Expand
Highly Cited
1972
Highly Cited
1972
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
J. Edmonds
,
R. Karp
Combinatorial Optimization
1972
Corpus ID: 6375478
This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem and the general minimum…
Expand
Highly Cited
1956
Highly Cited
1956
NETWORK FLOW THEORY
L. R. Ford
1956
Corpus ID: 60085760
Abstract : The labeling algorithm for the solution of maximal network flow problems and its application to various problems of…
Expand
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)
ACCEPT & CONTINUE