Newsgroups: sci.math,comp.theory,comp.parallel
From: srimani@carter.CS.ColoState.EDU (Pradip Srimani)
Subject: Vertex Disjoint paths in a hypercube
Organization: Colorado State University
Date: Tue, 11 Jul 1995 20:27:38 GMT
Message-ID: <3tumrq$grb@carter.cs.colostate.edu>

A hypercube of dimension n has veretx connectivity n. So, given a
source node s and n distinct destination nodes v1, v2, ...,vn,
there must be vertex disjoint paths from s to each v_i. What
would be an algorithm to trace those vertex disjoint paths give s
and v_i's? And, what would be the lengths of those paths?
I'll appreciate any help.

Best regards,
Pradip

-- 
Pradip K Srimani                Voice: (970) 491-7097
Department of Computer Science  Email: srimani@CS.Colostate.EDU
Colorado State University       Fax: (970) 491-2466
Ft. Collins, CO 80523           Secretary: (970) 491-5862


