290 search results - page 25 / 58 » Balancing Applied to Maximum Network Flow Problems |
CSC
2006
2006
An Adaptive Method for Flow Simulation in Three-Dimensional Heterogeneous Discrete Fracture Networks
14 years 11 months ago
Natural fractured media are highly unpredictable because of existing complex structures at the fracture and at the network levels. Fractures are by themselves heterogeneous objects...
103
click to vote
SPAA
2010
ACM
15 years 2 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
102
click to vote
ISPAN
2008
IEEE
15 years 4 months ago
2008
IEEE
Intuitively, a signed graph is a graph in which every edge is labeled with a + or − sign. For each edge, its sign represents the mode of the relationship between the vertices it...
STOC
2007
ACM
15 years 10 months ago
2007
ACM
We study the stability of the Max-Weight protocol for combined routing and scheduling in communication networks. Previous work has shown that this protocol is stable for adversari...
EOR
2008
14 years 9 months ago
2008
The Cooperative Water Allocation Model (CWAM) is designed within a general mathematical programming framework for modeling equitable and efficient water allocation among competing...