| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437480 | Theoretical Computer Science | 2011 | 13 Pages |
Abstract
We investigate an oblivious routing scheme, amenable to distributed computation and resilient to graph changes, based on electrical flow. Our main technical contribution is a new rounding method which we use to obtain a bound on the ℓ1→ℓ1 operator norm of the inverse graph Laplacian. We show how this norm reflects both latency and congestion of electric routing.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
