✦ LIBER ✦

Maximum flow problem on dynamic generative network flows with time-varying bounds

✍ Scribed by Hassan Salehi Fathabadi; Seyed Ahmad Hosseini

Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 345 KB
Volume: 34
Category: Article
ISSN: 0307-904X
DOI: 10.1016/j.apm.2009.10.026

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improving time bounds on maximum general

Improving time bounds on maximum generalised flow computations by contracting the network

✍ Tomasz Radzik 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 451 KB

We consider the maximum generalised network ow problem and a supply-scaling algorithmic framework for this problem. We present three network-modiÿcation operations, which may signiÿcantly decrease the size of the network when the remaining node supplies become small. We use these three operations in

On the Strong Maximum Principle and the

On the Strong Maximum Principle and the Large Time Behavior of Generalized Mean Curvature Flow with the Neumann Boundary Condition

✍ Giga Yoshikazu; Masaki Ohnuma; Moto-Hiko Sato 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 186 KB