BibTeX
@MISC{Frieze_splittingan,
author = {Alan M. Frieze and Michael Molloy},
title = {Splitting an Expander Graph},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Let G = (V; E) be an r-regular expander graph. Certain algorithms for finding edge disjoint paths require the edges of G to be partitioned into E = E 1 [ E 2 [ \Delta \Delta \Delta [ E k so that the graphs G i = (V; E i ) are each expanders. In this paper we give a non-constructive proof of a very good split plus an algorithm which improves on that given in Broder, Frieze and Upfal, Existence and construction of edge disjoint paths on expander graphs, SIAM Journal on Computing 23 (1994) 976-989. 1
