𝔖 Bobbio Scriptorium
✦   LIBER   ✦

In traffic flow, cellular automata = kinematic waves

✍ Scribed by Carlos F. Daganzo


Book ID
116937314
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
143 KB
Volume
40
Category
Article
ISSN
0191-2615

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Maximum (s, t)-Flows in Planar Netw
✍ Karsten Weihe πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 634 KB

Let G=(V, A) be a directed, planar graph, let s, t # V, s{t, and let c a >0 be the capacity of an arc a # A. The problem is to find a maximum flow from s to t in G subject to these capacities. The best asymptotic bound known so far is O(n log n } min[-n, 3 n log C]), where n= |V | and C= a # A c a