Splitting an Expander Graph

Let G=(V,E) be an r-regular expander graph. Certain algorithms for finding edge disjoint paths require that its edges be partitioned into E=E1∪E2∪···∪Ek so that the graphs Gi=(V,Ei) are each expanders. In this paper we give a nonconstructive proof of the existence a very good split plus an algorithm...

Full description

Saved in:
Bibliographic Details
Published inJournal of algorithms Vol. 33; no. 1; pp. 166 - 172
Main Authors Frieze, Alan M, Molloy, Michael
Format Journal Article
LanguageEnglish
Published San Diego, CA Elsevier Inc 01.10.1999
Elsevier
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Information retrieval. Graph
Theoretical computing
Edge(graph)
Graph theory
Algorithm
Computational complexity
Regular graph
Online AccessGet full text

Cover

More Information
Summary:Let G=(V,E) be an r-regular expander graph. Certain algorithms for finding edge disjoint paths require that its edges be partitioned into E=E1∪E2∪···∪Ek so that the graphs Gi=(V,Ei) are each expanders. In this paper we give a nonconstructive proof of the existence a very good split plus an algorithm for finding a partition better than that given in A. Z. Broder, A. M. Frieze, and E. Upfal (SIAM J. Comput.23 (1994), 976–989).
ISSN:0196-6774
1090-2678
DOI:10.1006/jagm.1999.1023