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

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!