Keyword : node-to-set disjoint paths problem


An Algorithm for Node-to-Set Disjoint Paths Problem in Bi-Rotator Graphs
Keiichi KANEKO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2006/02/01
Vol. E89-D  No. 2 ; pp. 647-653
Type of Manuscript:  Special Section PAPER (Special Section on Parallel/Distributed Computing and Networking)
Category: Parallel/Distributed Algorithms
Keyword: 
node-to-set disjoint paths problembi-rotator graphsfault toleranceparallel computationrouting algorithm
 Summary | Full Text:PDF

An Algorithm for Node-to-Set Disjoint Paths Problem in Rotator Graphs
Keiichi KANEKO Yasuto SUZUKI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2001/09/01
Vol. E84-D  No. 9 ; pp. 1155-1163
Type of Manuscript:  PAPER
Category: Algorithms
Keyword: 
rotator graphsnode-to-set disjoint paths probleminterconnection networkparallel and distributed processing
 Summary | Full Text:PDF