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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2019
Review
2019
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
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
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
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
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 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
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
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
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
Abstract : The labeling algorithm for the solution of maximal network flow problems and its application to various problems of… Expand
Is this relevant?