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.
2014
2014
3D Coupled Cellular Automaton (CA)–Finite Element (FE) Modeling for Solidification Grain Structures in Gas Tungsten Arc Welding (GTAW)
A coupled Cellular Automaton (CA) – Finite Element (FE) model is proposed to predict the grain structure formation during Gas… 
Highly Cited
2007
Highly Cited
2007
An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading
Abstract This paper introduces an additive branch-and-bound algorithm for two variants of the pickup and delivery traveling… 
Highly Cited
2005
Highly Cited
2005
Shadow flow: a recursive method to learn moving cast shadows
We present a novel algorithm to detect and remove cast shadows in a video sequence by taking advantage of the statistical… 
Highly Cited
2004
Highly Cited
2004
Self-healing reconfiguration for restoration of naval shipboard power systems
Naval shipboard power systems form a critical component of the U.S. defense infrastructure. When there is a fault in a shipboard… 
Highly Cited
2002
Highly Cited
2002
Cache-and-Relay Streaming Media Delivery for Asynchronous Clients
We consider the problem of delivering popular streaming media to a large number of asynchronous clients. We propose and evaluate… 
Review
2000
Review
2000
Simulation and Numerical Methods in Real Options Valuation
This paper provides an overview of numerical methods and its applicability for solving real option problems. It discusses… 
Review
2000
Review
2000
Phenomenological foundation and mathematical theory of sedimentation–consolidation processes
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… 
Highly Cited
1990
Highly Cited
1990
Object-oriented programming for flexible software: example of a load flow
The basic elements of object-oriented programming (OOP) are introduced. The advantages of this software approach for energy… 
Highly Cited
1982
Highly Cited
1982
CONSISTENT LINK FLOW ESTIMATION FROM COUNTS
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)