Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2019
Review
2019
Network optimizations in the Internet of Things: A review
Abstract The Internet was initially used to transfer data packets between users and data sources with a specific IP address. Due… Expand
Is this relevant?
Review
2018
Review
2018
The statistical physics of real-world networks
In the past 15 years, statistical physics has been successful as a framework for modelling complex networks. On the theoretical… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
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… Expand
Is this relevant?
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… Expand
Is this relevant?
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Centrality and network flow
Centrality measures, or at least popular interpretations of these measures, make implicit assumptions about the manner in which… Expand
  • table 1
  • figure 1
  • table 2
  • figure 4
  • table 3
Is this relevant?
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… Expand
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
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… Expand
  • figure 1
Is this relevant?
Highly Cited
1962
Highly Cited
1962
Flows in Networks.
In this classic book, first published in 1962, L. R. Ford, Jr., and D. R. Fulkerson set the foundation for the study of network… Expand
Is this relevant?
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… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE