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

Abstract 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).
AbstractList 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).
Author Molloy, Michael
Frieze, Alan M
Author_xml – sequence: 1
  givenname: Alan M
  surname: Frieze
  fullname: Frieze, Alan M
  organization: Department of Mathematical Sciences, Carnegie-Mellon University, Pittsburgh, Pennsylvania, 15213, f1alan@random.math.cmu.eduf1
– sequence: 2
  givenname: Michael
  surname: Molloy
  fullname: Molloy, Michael
  organization: Department of Computer Science, University of Toronto, Toronto, Ontario, M5S 3G4, Canadaf2molloy@cs.toronto.eduf2
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1961221$$DView record in Pascal Francis
BookMark eNp1jz1PwzAQhi1UJNrCysKSgTXBZ9d2PKKqFKRKDMBsOf4orlonsiME_55EQerEdDrpfd67Z4FmsY0OoVvAFWDMHw56f6pASjmshF6gOWCJS8JFPUNzDJKXXIjVFVrkfMAYgK3kHN29dcfQ9yHuCx2LzXeno3Wp2CbdfV6jS6-P2d38zSX6eNq8r5_L3ev2Zf24Kw1lrC-t9TVw0ghviG2M117gphGEasps44BZChhqyaAxzGoqhhhmVtaeEOq4pEtUTb0mtTkn51WXwkmnHwVYjWpqVFOjmhrVBuB-AjqdjT76pKMJ-UxJDoTAEKunmBue_wouqWyCi8bZkJzplW3Dfxd-AbPNYqA
CODEN JOALDV
CitedBy_id crossref_primary_10_1002_jgt_22003
crossref_primary_10_1137_S0097539700366103
crossref_primary_10_1017_S0963548308009334
crossref_primary_10_1137_S0895480193259825
crossref_primary_10_1090_bull_1557
crossref_primary_10_1137_S0097539701398582
crossref_primary_10_1002_rsa_20016
Cites_doi 10.1002/rsa.3240020402
10.1137/S0097539792232021
10.1002/rsa.3240020403
10.1137/S0097539700379760
ContentType Journal Article
Copyright 1999 Academic Press
1999 INIST-CNRS
Copyright_xml – notice: 1999 Academic Press
– notice: 1999 INIST-CNRS
DBID IQODW
AAYXX
CITATION
DOI 10.1006/jagm.1999.1023
DatabaseName Pascal-Francis
CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
Applied Sciences
EISSN 1090-2678
EndPage 172
ExternalDocumentID 10_1006_jagm_1999_1023
1961221
S0196677499910234
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1RT
1~.
1~5
29J
4.4
4G.
5GY
5VS
7-5
71M
8P~
9JN
AACTN
AAEDT
AAEDW
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABAOU
ABBOA
ABEFU
ABMAC
ABTAH
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADFGL
ADGUI
ADIYS
ADJOM
ADMUD
AEBSH
AEKER
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CAG
COF
CS3
DM4
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FA8
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
G8K
GBOLZ
HLZ
HMJ
HVGLF
HZ~
IHE
KOM
LG5
LX9
M25
MHUIS
MO0
MVM
N9A
O-L
O9-
OAUVE
OZT
P-9
P2P
PC.
Q38
R2-
RIG
ROL
RPZ
SBC
SDF
SDG
SDP
SEW
SME
SPC
SSV
SSW
SSZ
T5K
TN5
TWZ
UPT
UQL
WUQ
XJT
XPP
YQT
ZCA
ZU3
ZY4
08R
ABPIF
ABPTK
IQODW
AAXKI
AAYXX
AKRWK
CITATION
ID FETCH-LOGICAL-c355t-ddf8162b7fc2dbcfaf70bb723a35dbe15d31018951bc5da37c2d05d98f223e693
IEDL.DBID .~1
ISSN 0196-6774
IngestDate Thu Sep 12 19:12:59 EDT 2024
Sun Oct 29 17:08:16 EDT 2023
Fri Feb 23 02:22:55 EST 2024
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords Edge(graph)
Graph theory
Algorithm
Computational complexity
Regular graph
Language English
License CC BY 4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c355t-ddf8162b7fc2dbcfaf70bb723a35dbe15d31018951bc5da37c2d05d98f223e693
OpenAccessLink https://tspace.library.utoronto.ca/bitstream/1807/9471/3/splitting%20an%20expander%20graph.pdf
PageCount 7
ParticipantIDs crossref_primary_10_1006_jagm_1999_1023
pascalfrancis_primary_1961221
elsevier_sciencedirect_doi_10_1006_jagm_1999_1023
PublicationCentury 1900
PublicationDate 1999-10-01
PublicationDateYYYYMMDD 1999-10-01
PublicationDate_xml – month: 10
  year: 1999
  text: 1999-10-01
  day: 01
PublicationDecade 1990
PublicationPlace San Diego, CA
PublicationPlace_xml – name: San Diego, CA
PublicationTitle Journal of algorithms
PublicationYear 1999
Publisher Elsevier Inc
Elsevier
Publisher_xml – name: Elsevier Inc
– name: Elsevier
References Molloy, Reed (RF10) 1998
Beck (RF3) 1991; 2
Broder, Frieze, Upfal (RF5) 1997
T. Leighton, S. Rao, and, A. Srinivasan, Multi-commodity flow and circuit switching
T. Leighton, S. Rao, and, A. Srinivasan, New algorithmic aspects of the local lemma with applications to partitioning and routing
Broder, Frieze, Upfal (RF4) 1994; 23
Knuth (RF6) 1968
T. Leighton, and, S. Rao, Circuit switching: A multicommodity flow based approach
Proceedings of the Hawaii International Conference on System Sciences, 1998.
Proceedings of SODA '99.
Alon, Spencer (RF2) 1992
Alon (RF1) 1991; 2
Proceedings of a Workshop on Randomized Parallel Computing, 1996.
Alon (10.1006/jagm.1999.1023_RF1) 1991; 2
Knuth (10.1006/jagm.1999.1023_RF6) 1968
Molloy (10.1006/jagm.1999.1023_RF10) 1998
Beck (10.1006/jagm.1999.1023_RF3) 1991; 2
Broder (10.1006/jagm.1999.1023_RF5) 1997
Alon (10.1006/jagm.1999.1023_RF2) 1992
Broder (10.1006/jagm.1999.1023_RF4) 1994; 23
10.1006/jagm.1999.1023_RF9
10.1006/jagm.1999.1023_RF8
10.1006/jagm.1999.1023_RF7
References_xml – volume: 2
  start-page: 366
  year: 1991
  end-page: 378
  ident: RF1
  article-title: A parallel algorithmic version of the Local Lemma
  publication-title: Random Struct. Algorithms
  contributor:
    fullname: Alon
– year: 1992
  ident: RF2
  publication-title: The Probabilistic Method
  contributor:
    fullname: Spencer
– volume: 2
  start-page: 343
  year: 1991
  end-page: 365
  ident: RF3
  article-title: An algorithmic approach to the Lovász local lemma
  publication-title: Random Struct. Algorithms
  contributor:
    fullname: Beck
– year: 1997
  ident: RF5
  article-title: Existence and construction of edge low congestion paths on expander graphs
  publication-title: Proceedings of the 29th Annual ACM Symposium on Theory of Computing
  contributor:
    fullname: Upfal
– year: 1998
  ident: RF10
  article-title: Further algorithmic aspects of the local lemma
  publication-title: Proceedings of the 30th Annual ACM Symposium on Theory of Computing
  contributor:
    fullname: Reed
– year: 1968
  ident: RF6
  article-title: The Art of Computer Programming
  publication-title: Fundamental Algorithms
  contributor:
    fullname: Knuth
– volume: 23
  start-page: 976
  year: 1994
  end-page: 989
  ident: RF4
  article-title: Existence and construction of edge-disjoint paths on expander graphs
  publication-title: SIAM J. Comput.
  contributor:
    fullname: Upfal
– ident: 10.1006/jagm.1999.1023_RF7
– ident: 10.1006/jagm.1999.1023_RF8
– volume: 2
  start-page: 343
  year: 1991
  ident: 10.1006/jagm.1999.1023_RF3
  article-title: An algorithmic approach to the Lovász local lemma
  publication-title: Random Struct. Algorithms
  doi: 10.1002/rsa.3240020402
  contributor:
    fullname: Beck
– volume: 23
  start-page: 976
  year: 1994
  ident: 10.1006/jagm.1999.1023_RF4
  article-title: Existence and construction of edge-disjoint paths on expander graphs
  publication-title: SIAM J. Comput.
  doi: 10.1137/S0097539792232021
  contributor:
    fullname: Broder
– year: 1997
  ident: 10.1006/jagm.1999.1023_RF5
  article-title: Existence and construction of edge low congestion paths on expander graphs
  contributor:
    fullname: Broder
– year: 1998
  ident: 10.1006/jagm.1999.1023_RF10
  article-title: Further algorithmic aspects of the local lemma
  contributor:
    fullname: Molloy
– year: 1992
  ident: 10.1006/jagm.1999.1023_RF2
  contributor:
    fullname: Alon
– volume: 2
  start-page: 366
  year: 1991
  ident: 10.1006/jagm.1999.1023_RF1
  article-title: A parallel algorithmic version of the Local Lemma
  publication-title: Random Struct. Algorithms
  doi: 10.1002/rsa.3240020403
  contributor:
    fullname: Alon
– year: 1968
  ident: 10.1006/jagm.1999.1023_RF6
  article-title: The Art of Computer Programming
  contributor:
    fullname: Knuth
– ident: 10.1006/jagm.1999.1023_RF9
  doi: 10.1137/S0097539700379760
SSID ssj0011549
Score 1.5444314
Snippet 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...
SourceID crossref
pascalfrancis
elsevier
SourceType Aggregation Database
Index Database
Publisher
StartPage 166
SubjectTerms Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Information retrieval. Graph
Theoretical computing
Title Splitting an Expander Graph
URI https://dx.doi.org/10.1006/jagm.1999.1023
Volume 33
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnZ3LS8NAEMaHohdBfIu1tuQgeFrz3mSPpbRWxV5qobewj6xUMBat4Mm_3Zk81B568Ro2r2-TmS9h5rcAl0IHUkeRZlbnAYtiETH8DkmY5xklbKrQ4dN_yIcJH8-iu3k8b8Gg6YWhsso69lcxvYzW9Ra3VtNdLhbulMguHN0LWRzMPMQEJdgWPtPXXz9lHkSbEVXLNGc0ugE3etx9lk8v1K0nSn7BpsS0u5TvKJet1rn4k3xGB7BXu0anX13YIbTy4gj2mxUZnPoFPYbOFD1lWcnsyMIZfi7L3hXnhqjUJzAbDR8HY1Yvf8A0moAVM8amPg9UYnVglLbSJp5SSRDKMDYq92MTEm4LLZLSsZFhgsO82IjUYsrPuQhPYat4LfIzcDTqbtLUpGgXojg0kocJOhODUVJKk_htuGruPVtWlIus4hnzjFTKSKWMVGqD30iTrc1ThiF44z7dNQ1_TyHQXwX--T-O2YGdQBDfksrqLmBr9faRd9EerFSvnP8ebPdv78eTb7pBuIU
link.rule.ids 315,783,787,4511,24130,27938,27939,45599,45693
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnZ25T8MwFMatUgaQEDeilEIGJCaTy3HiEVUtBdoubaVulo8YFYkQQZGY-Nt5zgF06MIaOdcX571fovc-I3TFVCAUIQoblQaYRIxg-A6JsedpyUwigfDtf8jRmA5m5GEezRuoW_fC2LLKKvaXMb2I1tUWt1LTzRcLd2KdXSjQi0UcyDxkA20S658Fk_rm66fOw9rNsLJnmmI7vHZu9Kj7LJ5ebLseKwwM1mWmnVy8g16mXOjiT_bp76PdChud2_LKDlAjzQ7RXr0kg1O9oUeoPQGoLEqZHZE5vc-8aF5x7qwt9TGa9XvT7gBX6x9gBRSwxFqbxKeBjI0KtFRGmNiTMg5CEUZapn6kQ-u3BYwkVaRFGMMwL9IsMZDzU8rCE9TMXrP0FDkKhNdJohPgBRKFWtAwBjTRECaF0LHfQtf1vfO8tLngpaEx5VYlblXiVqUW8mtp-MqD4hCD1-7TWdHw9xQMACvwz_5xzEu0NZiOhnx4P35so-3CTaGosTtHzeXbR9oBVljKi2IufANn-Lox
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Splitting+an+expander+graph&rft.jtitle=Journal+of+algorithms&rft.au=FRIEZE%2C+A.+M&rft.au=MOLLOY%2C+M&rft.date=1999-10-01&rft.pub=Elsevier&rft.issn=0196-6774&rft.eissn=1090-2678&rft.volume=33&rft.issue=1&rft.spage=166&rft.epage=172&rft_id=info:doi/10.1006%2Fjagm.1999.1023&rft.externalDBID=n%2Fa&rft.externalDocID=1961221
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0196-6774&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0196-6774&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0196-6774&client=summon