Keyword : bi-rotator graphs


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

Internally-Disjoint Paths Problem in Bi-Rotator Graphs
Keiichi KANEKO 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2005/07/01
Vol. E88-D  No. 7 ; pp. 1678-1684
Type of Manuscript:  PAPER
Category: Dependable Computing
Keyword: 
container probleminternally-disjoint pathsbi-rotator graphsfault toleranceparallel computation
 Summary | Full Text:PDF