Chipping Away
Speaker:
Chan, O-Yeat
Affiliation:
University of Newcastle Abstract
We describe a single-node traffic flow process on a graph and analyze its asymptotic properties. As traffic flows through the graph, we "chip away" at the edges until every edge has accumulated a fixed number of "chips". We investigate the smallest number of steps required for this stop condition to occur. This is joint work with Pawel Pralat.
Details
Date & Time:
Thursday, May 19, 2011 - 17:00 - 17:30
Venue/Room:
ASB 10908 - ‹ previous
- 51 of 62
- next ›