A topological property of hypercubes: node disjoint paths

A graph G=(V,E) ( mod V mod >or=2n) satisfies property P/sub n/ if given any 2n distinct vertices s/sub 1/,s/sub 2/, . . ., s/sub n/, g/sub 1/,g/sub 2/, . . ., g/sub n/ in V, there exist n node disjoint paths p/sub i/(s/sub i/, g/sub i/) (i=1, . . ., n) in G such that p/sub i/ is a path from s/su...

Full description

Saved in:
Bibliographic Details
Published in:Parallel and Distributed Processing, 2nd IEEE Symposium On pp. 532 - 539
Main Authors: Madhavapeddy, S., Sudborough, I.H.
Format: Conference Proceeding
Language:English
Published: IEEE Comput. Soc. Press 1990
Subjects:
Algorithm design and analysis
Computer networks
Computer science
Concurrent computing
Hypercubes
Joining processes
Multiprocessor interconnection networks
Parallel algorithms
Routing
ISBN:0818620870, 9780818620874
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract A graph G=(V,E) ( mod V mod >or=2n) satisfies property P/sub n/ if given any 2n distinct vertices s/sub 1/,s/sub 2/, . . ., s/sub n/, g/sub 1/,g/sub 2/, . . ., g/sub n/ in V, there exist n node disjoint paths p/sub i/(s/sub i/, g/sub i/) (i=1, . . ., n) in G such that p/sub i/ is a path from s/sub i/ to g/sub i/. A necessary (but not sufficient) condition for any graph to satisfy P/sub n/ is that it be (2n-1)-connected (MW). The authors prove the optimal result that the hypercube of dimension k, Q(k) (k>or=2n-1), satisfies P/sub n/(n>or=3). The proof is constructive and yields an O(n/sup 3/ log n) algorithm for finding up to (n/2) node disjoint paths in Q(n) (n>or=4) between mutually disjoint source-goal node pairs.< >
AbstractList A graph G=(V,E) ( mod V mod >or=2n) satisfies property P/sub n/ if given any 2n distinct vertices s/sub 1/,s/sub 2/, . . ., s/sub n/, g/sub 1/,g/sub 2/, . . ., g/sub n/ in V, there exist n node disjoint paths p/sub i/(s/sub i/, g/sub i/) (i=1, . . ., n) in G such that p/sub i/ is a path from s/sub i/ to g/sub i/. A necessary (but not sufficient) condition for any graph to satisfy P/sub n/ is that it be (2n-1)-connected (MW). The authors prove the optimal result that the hypercube of dimension k, Q(k) (k>or=2n-1), satisfies P/sub n/(n>or=3). The proof is constructive and yields an O(n/sup 3/ log n) algorithm for finding up to (n/2) node disjoint paths in Q(n) (n>or=4) between mutually disjoint source-goal node pairs.< >
Author Madhavapeddy, S.
Sudborough, I.H.
Author_xml – sequence: 1
  givenname: S.
  surname: Madhavapeddy
  fullname: Madhavapeddy, S.
  organization: Texas Univ., Richardson, TX, USA
– sequence: 2
  givenname: I.H.
  surname: Sudborough
  fullname: Sudborough, I.H.
  organization: Texas Univ., Richardson, TX, USA
BookMark eNotT0tLAzEYDKigrb2Lp_yBrcnm-Xkr1apQsGDvJc1-sSnrJmzWw_57F-rMYR6HgZmR6y51SMgDZ0vOGTx97V52Sw4wRSkUwBWZMcutrpk17JYsSjmzCUpNlbwjsKJDyqlN39G7luY-ZeyHkaZAT-Nk_e8RyzPtUoO0ieWcYjfQ7IZTuSc3wbUFF_86J_vN6379Xm0_3z7Wq20VLQyVNaA0QrBOT7TCS9GYYxDeGUCLdY2sMcrK0HimwaNUQaPRIUgPwMGKOXm8zEZEPOQ-_rh-PFy-iT_ztUb4
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/SPDP.1990.143599
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EndPage 539
ExternalDocumentID 143599
GroupedDBID 6IE
6IK
6IL
AAJGR
AAWTH
ACGHX
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
OCL
RIB
RIC
RIE
RIL
ID FETCH-LOGICAL-i89t-87956e9f8a6a6a83c43d7bf3ca79e8e22e0d7584fdc069ce45f6e76ff4c991983
IEDL.DBID RIE
ISBN 0818620870
9780818620874
IngestDate Tue Aug 26 17:03:07 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i89t-87956e9f8a6a6a83c43d7bf3ca79e8e22e0d7584fdc069ce45f6e76ff4c991983
PageCount 8
ParticipantIDs ieee_primary_143599
PublicationCentury 1900
PublicationDate 19900000
PublicationDateYYYYMMDD 1990-01-01
PublicationDate_xml – year: 1990
  text: 19900000
PublicationDecade 1990
PublicationTitle Parallel and Distributed Processing, 2nd IEEE Symposium On
PublicationTitleAbbrev SPDP
PublicationYear 1990
Publisher IEEE Comput. Soc. Press
Publisher_xml – name: IEEE Comput. Soc. Press
SSID ssj0000558624
Score 1.2410666
Snippet A graph G=(V,E) ( mod V mod >or=2n) satisfies property P/sub n/ if given any 2n distinct vertices s/sub 1/,s/sub 2/, . . ., s/sub n/, g/sub 1/,g/sub 2/, . . .,...
SourceID ieee
SourceType Publisher
StartPage 532
SubjectTerms Algorithm design and analysis
Computer networks
Computer science
Concurrent computing
Hypercubes
Joining processes
Multiprocessor interconnection networks
Parallel algorithms
Routing
Title A topological property of hypercubes: node disjoint paths
URI https://ieeexplore.ieee.org/document/143599
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT4MwGG3c4sHTdM74Oz14xbECbT9vRl08LSTusNsC7deIB1iAmfjf2xY2Y-LFcGk5EPIV8nivvO8RcmcxU6OlPgEXOgucxhCAJXDO4CMZsBmqXPuwCbFYyNUK0r7PtvfCIKL_-Qzv3dDv5etKbZ1UNnXYDjAgAyF4Z9Xayylhkjirg-_wOLOj0D6HfX-d3Tze7VKGMH1Ln1Nn1LNTf81f2SoeWuajf93UMZn8WPRougefE3KA5ZiMdhkNtH9lTwk80rbLQXCrQTdOe6_bL1oZ-m4paK22OTYPtKw0Ul00H1VRttTFFDcTspy_LJ9egz4uISgktIFLDecIRmbcHjJScaRFbiKVCUCJjGGoLTmIjVYhB4VxYjgKbkys7DciyOiMDMuqxHNCIVGW2KhQ5K77GGMZWhTPLLXgwFAl4oKMXR3Wm64hxrorweWfZ6_Ikatzp1pck2Fbb_GGHKrPtmjqW7-I33ynmSM
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT4MwGP2i00RP0znjb3vwimMFSuvNqMuMcyFxh90WaD8iHmABZuJ_b1vYjIkXw6XlQMhXyOO98r4HcKMxU6GmPg4LVewYjcERmsAZgw-ngg5RJsqGTYTTKZ_PRdT22bZeGES0P5_hrRnavXxVyJWRygYG24XYhp3A96nbmLU2goobBMbsYHs8DvXI1U9i22FnPffX-5SuGLxFj5Gx6umpveqvdBULLqPuv27rAPo_Jj0SbeDnELYw70F3ndJA2pf2CMQ9qZskBLMeZGnU97L-IkVK3jUJLeUqweqO5IVCorLqo8jympig4qoPs9HT7GHstIEJTsZF7ZjccIYi5THTB_ek76kwST0ZhwI5Uoqu0vTAT5V0mZDoBynDkKWpL_VXouDeMXTyIscTICKQmtpIN0xM_zFKY9Q4HmtywQRFGYSn0DN1WCyblhiLpgRnf569hr3x7HWymDxPX85h39S80TAuoFOXK7yEXflZZ1V5ZRf0G6gQnGo
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%3Abook&rft.genre=proceeding&rft.title=Parallel+and+Distributed+Processing%2C+2nd+IEEE+Symposium+On&rft.atitle=A+topological+property+of+hypercubes%3A+node+disjoint+paths&rft.au=Madhavapeddy%2C+S.&rft.au=Sudborough%2C+I.H.&rft.date=1990-01-01&rft.pub=IEEE+Comput.+Soc.+Press&rft.isbn=9780818620874&rft.spage=532&rft.epage=539&rft_id=info:doi/10.1109%2FSPDP.1990.143599&rft.externalDocID=143599
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818620874/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818620874/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818620874/sc.gif&client=summon&freeimage=true