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… (More)
Wikipedia

Related topics

Related topics

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
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… (More)
  • figure 1
  • table 1
  • table 2
  • table 4
  • table 5
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2008
Highly Cited
2008
Network Information Flow in Network of Queues
Two classic categories of models exist for computer networks: network information flow and network of queues. The network… (More)
  • figure 1
  • figure 2
  • figure 6
  • figure 5
  • figure 7
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Centrality and network flow
Centralitymeasures, or at least popular interpretations of thesemeasures,make implicit assumptions about the manner in which… (More)
  • table 1
  • figure 1
  • table 2
  • figure 4
  • table 3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Complexity classification of network information flow problems
We address the network information flow problem, in which messages available to a set of sources must be passed through a network… (More)
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… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Centrality in valued graphs: A measure of betweenness based on network flow
A new measure of centrality, C,, is introduced. It is based on the concept of network flows. While conceptually similar to… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Linear Programming and Network Flows
linear programming and network flows, 3rd yazd linear programming: chapter 13 network flows: theory linear programming and… (More)
Is this relevant?
Highly Cited
1977
Highly Cited
1977
Multiprocessor Scheduling with the Aid of Network Flow Algorithms
In a distributed computing system a modular program must have its modules assigned among the processors so as to avoid excessive… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1972
Highly Cited
1972
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
This paper presents new algori thms for the maximum flow problem, the Hitchcock t r anspo r t a t i on problem, and the general… (More)
  • figure 1
Is this relevant?