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.
2008
2008
A dynamic scheduling approach for coordinated wide-area data transfers using GridFTP
Many scientific applications need to stage large volumes of files from one set of machines to another set of machines in a wide… 
2007
2007
On LES and DES of Wall Bounded Flows
2006
2006
LEARN: localized energy aware restricted neighborhood routing for ad hoc networks
In this paper, we address the problem of energy efficient localized routing in wireless ad hoc networks. Numerous energy aware… 
2005
2005
On the θ-coverage and connectivity of large random networks ∗ †
Wireless planar networks have been used to model wireless networks in a tradition that dates back to 1961 to the work of E. N… 
2005
2005
Scalable routing for networked sensors and actuators
  • T. Fuhrmann
  • Second Annual IEEE Communications Society…
  • 2005
  • Corpus ID: 7391210
The design of efficient routing protocols for ad hoc and sensor networks is challenging for several reasons: Physical network… 
2004
2004
A new algorithm for relative localization in wireless sensor networks
Summary form only given. Knowing the positions of nodes in sensor networks are essential for many applications. We propose a new… 
2001
2001
Analysis of ill-conditioned power-flow problems using voltage stability methodology
Ill-conditioned power-flow problems have been widely investigated and reported in the literatun:. A typical approach develops… 
Highly Cited
1996
Highly Cited
1996
Module assignment for low power
We investigate the problem of minimizing the total power consumption during the binding of operations to functional units in a… 
1991
1991
On the Arnol'd stability criterion for steady-state flows of an ideal fluid
It is proved that, contrarily to the 2-D case, the sufficient Arnol’d stability criterion for steady-state solutions of the… 
1990
1990
Topological reconfiguration of ATM networks
  • J. MonteiroM. Gerla
  • Proceedings. IEEE INFOCOM '90: Ninth Annual Joint…
  • 1990
  • Corpus ID: 5596411
The topological reconfiguration of an asynchronous transfer mode (ATM) network embedded into a backbone facility network that…