✦ LIBER ✦

A parametric maximum flow algorithm for bipartite graphs with applications

✍ Scribed by Y.L. Chen

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 682 KB
Volume: 80
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(93)e0161-p

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear time algorithm for maximum matc

A linear time algorithm for maximum matchings in convex, bipartite graphs

✍ G. Steiner; J.S. Yeomans 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 563 KB

A new—old algorithm for minimum-cut and

A new—old algorithm for minimum-cut and maximum-flow in closure graphs

✍ Dorit S. Hochbaum 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 307 KB

A refined simplex algorithm for the clas

A refined simplex algorithm for the classical transportation problem with application to parametric analysis

✍ H. Arsham; A.B. Kahn 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 583 KB

An O(n-log-log-n) Time Algorithm for Con

An O(n-log-log-n) Time Algorithm for Constructing a Graph of Maximum Connectivity with Prescribed Degrees

✍ T. Asano 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 601 KB

A stable algorithm for Reynolds stress t

A stable algorithm for Reynolds stress turbulence modelling with applications to rectilinear and circular tidal flows

✍ S. G. Sajjadi; M. N. Waywell 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 321 KB 👁 2 views

This paper employs one-point, linear eddy viscosity and differential second-moment (DSM) turbulence closures to predict the turbulent characteristics of both rectilinear and circular tidal ¯ows. The numerical scheme is based on a ®nite volume approach applied to a non-staggered grid such that all ¯o

A parametric-space-based scan-line algor

A parametric-space-based scan-line algorithm for rendering bicubic surfaces: Pueyo, X and Brunet, PIEEE Comput. Graph. & Applic. Vol 7 No 11 (November 1987) pp 17–25

📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 127 KB