Skip to main content
Conference Proceedings

Electric routing and concurrent flow cutting

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5878 LNCS 792-801
DOI: 10.1007/978-3-642-10631-6_80
0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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 L 1→L 1 operator norm of the inverse graph Laplacian. © 2009 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Kelner, J., & Maymounkov, P. (2009). Electric routing and concurrent flow cutting. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5878 LNCS, pp. 792–801). https://doi.org/10.1007/978-3-642-10631-6_80

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free